Browse · MathNet
PrintInternational Mathematical Olympiad Shortlisted Problems
algebra
Problem
Let be a positive integer, and let be an infinite sequence of real numbers. Assume that for all nonnegative integers and there exists a positive integer such that Prove that the sequence is periodic, i.e. there exists some such that for all .
Solution
For every indices we will denote ; thus . Let us start with the following lemma.
Lemma. Let be an infinite sequence. Assume that for every nonnegative integer there exists a nonnegative integer such that . Then for every indices there exists an index such that . Moreover, there are at most distinct numbers among the terms of .
Proof. To prove the first claim, let us notice that there exists an infinite sequence of indices such that and for all . This sequence is unbounded from above, thus it hits each segment of the form with , as required.
To prove the second claim, assume, to the contrary, that there exist distinct numbers . Let us apply the first claim to and ; we obtain that for every there exists such that . Thus the segment should contain distinct integers, which is absurd.
Setting in the problem condition, we see that the sequence satisfies the condition of the lemma, thus it attains at most distinct values. Denote by the ordered -tuple ; then among 's there are at most distinct tuples, so for every two of the tuples are identical. This means that there exists a positive integer such that the equality holds infinitely many times. Let be the set of indices satisfying this relation.
Now we claim that coincides with the set of all nonnegative integers. Since is unbounded, it suffices to show that whenever . For that, denote . The sequence satisfies the lemma conditions, so there exists an index such that . This last relation rewrites as . Since , we have , therefore we obtain and thus , as required.
Finally, we get for all , so in particular for all , QED.
Lemma. Let be an infinite sequence. Assume that for every nonnegative integer there exists a nonnegative integer such that . Then for every indices there exists an index such that . Moreover, there are at most distinct numbers among the terms of .
Proof. To prove the first claim, let us notice that there exists an infinite sequence of indices such that and for all . This sequence is unbounded from above, thus it hits each segment of the form with , as required.
To prove the second claim, assume, to the contrary, that there exist distinct numbers . Let us apply the first claim to and ; we obtain that for every there exists such that . Thus the segment should contain distinct integers, which is absurd.
Setting in the problem condition, we see that the sequence satisfies the condition of the lemma, thus it attains at most distinct values. Denote by the ordered -tuple ; then among 's there are at most distinct tuples, so for every two of the tuples are identical. This means that there exists a positive integer such that the equality holds infinitely many times. Let be the set of indices satisfying this relation.
Now we claim that coincides with the set of all nonnegative integers. Since is unbounded, it suffices to show that whenever . For that, denote . The sequence satisfies the lemma conditions, so there exists an index such that . This last relation rewrites as . Since , we have , therefore we obtain and thus , as required.
Finally, we get for all , so in particular for all , QED.
Techniques
Sums and productsPigeonhole principle