MathCastle
Number TheoryChallengeThe Chinese Remainder Theorem

The Chinese Remainder Theorem · Challenge problem

Find the smallest positive integer nn with n≡3(mod4)n \equiv 3 \pmod 4, n2≡2(mod7)n^2 \equiv 2 \pmod 7 and n3≡3(mod5)n^3 \equiv 3 \pmod 5.