Number TheoryChallengeThe Chinese Remainder Theorem ShareThe Chinese Remainder Theorem · Challenge problemHow many integers nnn with 1≤n≤10001 \le n \le 10001≤n≤1000 satisfy n≡1(mod6)n \equiv 1 \pmod 6n≡1(mod6) or n≡3(mod10)n \equiv 3 \pmod{10}n≡3(mod10) (or both)?Check Show answer Walk through it step by step Practice more like this Review this concept