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