ChallengeMediumHard Number Theory ShareHard Number Theory · Medium problemHow many integers xxx with 0≤x<1000\le x<1000≤x<100 satisfy x2≡1(mod100)x^2\equiv 1\pmod{100}x2≡1(mod100)?Check Show answer Walk through it step by step Practice more like this Review this concept