ChallengeSuperchallengeAdvanced Number Theory ShareAdvanced Number Theory · Superchallenge problemFind the smallest positive integer nnn satisfying n≡2(mod5)n\equiv2\pmod5n≡2(mod5), n≡3(mod7)n\equiv3\pmod7n≡3(mod7), and n≡4(mod9)n\equiv4\pmod9n≡4(mod9).Check Show answer Walk through it step by step Practice more like this Review this concept