MathDB
D 7

Source:

May 25, 2007
modular arithmeticnumber theoryCongruences

Problem Statement

Somebody incorrectly remembered Fermat's little theorem as saying that the congruence an+1a  (modn)a^{n+1} \equiv a \; \pmod{n} holds for all aa if nn is prime. Describe the set of integers nn for which this property is in fact true.