Difference between revisions of "2005 IMO Problems/Problem 2"
(Created page with "Let <math>a_1, a_2, \dots</math> be a sequence of integers with infinitely many positive and negative terms. Suppose that for every positive integer <math>n</math> the numbers...") |
(No difference)
|
Revision as of 12:19, 23 August 2020
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.