Number TheoryChallengeThe Chinese Remainder Theorem ShareThe Chinese Remainder Theorem · Challenge problemFind the smallest positive integer nnn with n≡3(mod4)n \equiv 3 \pmod 4n≡3(mod4), n2≡2(mod7)n^2 \equiv 2 \pmod 7n2≡2(mod7) and n3≡3(mod5)n^3 \equiv 3 \pmod 5n3≡3(mod5).Check Show answer Walk through it step by step Practice more like this Review this concept