Difference between revisions of "2005 IMO Problems/Problem 2"
| Line 8: | Line 8: | ||
==See Also== | ==See Also== | ||
| − | {{IMO box|year= | + | {{IMO box|year=2005|num-b=1|num-a=3}} |
Revision as of 23:57, 18 November 2023
Problem
Let 
be a sequence of integers with infinitely many positive and negative terms. Suppose that for every positive integer 
the numbers 
leave different remainders upon division by . Prove that every integer occurs exactly once in the sequence.
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
See Also
| 2005 IMO (Problems) • Resources | ||
| Preceded by Problem 1 |
1 • 2 • 3 • 4 • 5 • 6 | Followed by Problem 3 |
| All IMO Problems and Solutions | ||
