Problem

Source: 2011 Saudi Arabia IMO TST 4.1

Tags: number theory, remainder, factorial



Find all integers $n$, $n \ge 2$, such that the numbers $1!, 2 !,..., (n - 1)!$ give distinct remainders when divided by $n$.