Question 22
Let $ a_1, a_2, \ldots $ be a sequence of integers with infinitely many positive terms and infinitely many negative terms. Suppose that for each positive integer $ n $, the numbers $ a_1, a_2, \ldots, a_n $ leave $ n $ different remainders on division by $ n $. Prove that each integer occurs exactly once in the sequence.