Number TheoryHardThe Chinese Remainder Theorem ShareThe Chinese Remainder Theorem · Hard problemFind the smallest positive integer xxx with x≡2(mod3)x \equiv 2 \pmod{3}x≡2(mod3), x≡0(mod5)x \equiv 0 \pmod{5}x≡0(mod5) and x≡0(mod7)x \equiv 0 \pmod{7}x≡0(mod7).Check Show answer Walk through it step by step Practice more like this Review this concept