MathCastle
Number TheoryChallengeOrders and Primitive Roots

Orders and Primitive Roots · Challenge problem

How many xx with 1≤x≤1001 \le x \le 100 satisfy x20≡1(mod101)x^{20} \equiv 1 \pmod{101} but x10≢1(mod101)x^{10} \not\equiv 1 \pmod{101}?