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