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