Number TheoryHardThe Chinese Remainder Theorem ShareThe Chinese Remainder Theorem · Hard problemHow many integers nnn with 1≤n≤10001 \le n \le 10001≤n≤1000 satisfy n≡3(mod7)n \equiv 3 \pmod 7n≡3(mod7) and n≡5(mod11)n \equiv 5 \pmod{11}n≡5(mod11)?Check Show answer Walk through it step by step Practice more like this Review this concept