Problem

Source: Serbian National Olympiad 2013, Problem 2

Tags: modular arithmetic, number theory, Serbia



For a natural number $n$, set $S_n$ is defined as: \[S_n = \left \{ {n\choose n}, {2n \choose n}, {3n\choose n},..., {n^2 \choose n} \right \}.\] a) Prove that there are infinitely many composite numbers $n$, such that the set $S_n$ is not complete residue system mod $n$; b) Prove that there are infinitely many composite numbers $n$, such that the set $S_n$ is complete residue system mod $n$.