Number TheoryChallengeThe Chinese Remainder Theorem ShareThe Chinese Remainder Theorem · Challenge problemFind the sum of all xxx with 0≤x<10000 \le x < 10000≤x<1000 such that x2≡x(mod1000)x^2 \equiv x \pmod{1000}x2≡x(mod1000).Check Show answer Walk through it step by step Practice more like this Review this concept