Problem

Source:

Tags: modular arithmetic, Congruences



Determine the number of integers $n \ge 2$ for which the congruence \[x^{25}\equiv x \; \pmod{n}\] is true for all integers $x$.