Number TheoryHardThe Chinese Remainder Theorem ShareThe Chinese Remainder Theorem · Hard problemHow many positive integers n≤500n \le 500n≤500 satisfy x≡1(mod3),x≡3(mod7)x \equiv 1 \pmod{3},\quad x \equiv 3 \pmod{7}x≡1(mod3),x≡3(mod7)?Check Show answer Walk through it step by step Practice more like this Review this concept