olymmath

ISL 2006 A1

A sequence of real numbers a0,a1,a2,…a_{0}, a_{1}, a_{2}, \ldots is defined by the formula ai+1=⌊ai⌋⋅⟨ai⟩ for i≥0; a_{i+1}=\left\lfloor a_{i}\right\rfloor \cdot\left\langle a_{i}\right\rangle \text { for } i \geq 0 \text {; } here a0a_{0} is an arbitrary real number, ⌊ai⌋\left\lfloor a_{i}\right\rfloor denotes the greatest integer not exceeding aia_{i}, and ⟨ai⟩=ai−⌊ai⌋\left\langle a_{i}\right\rangle=a_{i}-\left\lfloor a_{i}\right\rfloor. Prove that ai=ai+2a_{i}=a_{i+2} for ii sufficiently large. (Estonia)

Dataset text NuminaMath olympiads. Quoted with source.

Official text: IMO 2006 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/2006/a1 · Tag 12PVSK7H55 · Edit this page on GitHub · Keys: j next, k previous