MathCastle
Number TheoryHardThe Chinese Remainder Theorem

The Chinese Remainder Theorem · Hard problem

Count the solutions of x3≡1(mod91)x^3 \equiv 1 \pmod{91} with 0≤x<910 \le x < 91.