Question 3Let $n$ be a prime number. Show that there is a permutation $a_1,a_2,\ldots,a_n$ of $1,2,\ldots,n$ so that $a_1$, $a_1a_2$, $\ldots$, $a_1a_2\cdots a_n$ leave distinct remainders when divided by $n$.