MathCastle
Number TheorySuperchallengeOrders and Primitive Roots

Orders and Primitive Roots · Superchallenge problem

For how many integers xx with 1≤x≤1561 \le x \le 156 is 2x≡x(mod13)2^x \equiv x \pmod{13}?