MathCastle
ChallengeMediumHard Number Theory

Hard Number Theory · Medium problem

How many integers xx with 0≤x<1000\le x<100 satisfy x2≡1(mod100)x^2\equiv 1\pmod{100}?