Number TheorySuperchallengeThe Chinese Remainder Theorem ShareThe Chinese Remainder Theorem · Superchallenge problemHow many integers xxx with 0≤x<7200 \le x < 7200≤x<720 satisfy x4≡x2(mod720)x^4 \equiv x^2 \pmod{720}x4≡x2(mod720)?Check Show answer Walk through it step by step Practice more like this Review this concept