olymmath

ISL 2020 C4

The Fibonacci numbers F0,F1,F2,…F_{0}, F_{1}, F_{2}, \ldots are defined inductively by F0=0,F1=1F_{0}=0, F_{1}=1, and Fn+1=Fn+Fn−1F_{n+1}=F_{n}+F_{n-1} for n⩾1n \geqslant 1. Given an integer n⩾2n \geqslant 2, determine the smallest size of a set SS of integers such that for every k=2,3,…,nk=2,3, \ldots, n there exist some x,y∈Sx, y \in S such that x−y=Fkx-y=F_{k}. (Croatia)

Official text Transcription from NuminaMath olympiads, checked word for word against the official paper. Quoted with source.

Official text: IMO 2020 Shortlist booklet, page 8.

Solutions

Official solution Solution 1 by the IMO Problem Selection Committee

The terms of the source let olymmath link to this solution but not copy it. Read the solution (IMO official site).

Similar problems

These problems have the most words in common with this statement.

Locator isl/2020/c4 · Tag DJQTC3BC38 · Edit this page on GitHub · Keys: j next, k previous