MathCastle
Number TheorySuperchallengeFermat, Euler and Wilson

Fermat, Euler and Wilson · Superchallenge problem

How many integers aa with 1≤a≤1001 \le a \le 100 satisfy a20≡1(mod100)a^{20} \equiv 1 \pmod{100}?