MathCastle
ChallengeChallenge

Challenge · Challenge problem

Find the smallest positive integer nn with n≡1(mod3)n \equiv 1 \pmod 3, n≡2(mod5)n \equiv 2 \pmod 5, and n≡3(mod7)n \equiv 3 \pmod 7.

Practice more like this