MathNet 2010 — Part 04 Question 77

Prove that there are infinitely many prime numbers $p$ such that $x^p \equiv 1 \pmod p$ equation has at least 2010 solutions in $\mathbb{Z}_p = \{0, 1, \dots, p-1\}$.
(proposed by U. Batzorig)