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