Browse · MathNet
PrintIMO 2006 Shortlisted Problems
2006 algebra
Problem
A sequence of real numbers is defined by the formula here is an arbitrary real number, denotes the greatest integer not exceeding , and . Prove that for sufficiently large.
Solution
First note that if , then all . For we have (in view of and ) the sequence is strictly decreasing as long as its terms are in . Eventually there appears a number from the interval and all subsequent terms are .
Now pass to the more interesting situation where ; then all . Suppose the sequence never hits . Then we have for all , and so this means that the sequence is nondecreasing. And since all its terms are integers from , this sequence must be constant from some term on: The defining formula becomes Consider the sequence It satisfies the recursion rule implying Since all the numbers (for ) lie in , the sequence is bounded. The equation (2) can be satisfied only if either or , i.e., .
In the first case, for all , so that In the second case, , equations (1) and (2) say that Summarising, we see that (from some point on) the sequence either is constant or takes alternately two values from the interval . The result follows.
Now pass to the more interesting situation where ; then all . Suppose the sequence never hits . Then we have for all , and so this means that the sequence is nondecreasing. And since all its terms are integers from , this sequence must be constant from some term on: The defining formula becomes Consider the sequence It satisfies the recursion rule implying Since all the numbers (for ) lie in , the sequence is bounded. The equation (2) can be satisfied only if either or , i.e., .
In the first case, for all , so that In the second case, , equations (1) and (2) say that Summarising, we see that (from some point on) the sequence either is constant or takes alternately two values from the interval . The result follows.
Techniques
Recurrence relationsFloors and ceilings