ChallengeChallenge ShareChallenge · Challenge problemFind the smallest positive integer nnn with n≡1(mod3)n \equiv 1 \pmod 3n≡1(mod3), n≡2(mod5)n \equiv 2 \pmod 5n≡2(mod5), and n≡3(mod7)n \equiv 3 \pmod 7n≡3(mod7).Check Show answer Walk through it step by step Practice more like this