RO-TST 2010

Let $a$ and $n$ be two positive integer numbers such that the (positive) prime factors of $a$ be all greater than $n$ . Prove that $n!$ divides $(a - 1)(a^2 - 1)\cdots (a^{n-1} - 1)$ .

AMM Magazine