olymmath

ISL 2019 C1

The infinite sequence a0,a1,a2,…a_{0}, a_{1}, a_{2}, \ldots of (not necessarily different) integers has the following properties: 0⩽ai⩽i0 \leqslant a_{i} \leqslant i for all integers i⩾0i \geqslant 0, and (ka0)+(ka1)+⋯+(kak)=2k\binom{k}{a_{0}}+\binom{k}{a_{1}}+\cdots+\binom{k}{a_{k}}=2^{k} for all integers k⩾0k \geqslant 0. Prove that all integers N⩾0N \geqslant 0 occur in the sequence (that is, for all N⩾0N \geqslant 0, there exists i⩾0i \geqslant 0 with ai=Na_{i}=N ).

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

Official text: IMO 2019 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).

Locator isl/2019/c1 · Tag 35BRNCRJ53 · Edit this page on GitHub · Keys: j next, k previous