Modular Arithmetichard
0:00.0

Find the smallest positive integer nn such that n2(mod3)n \equiv 2 \pmod{3}, n3(mod5)n \equiv 3 \pmod{5}, and n5(mod7)n \equiv 5 \pmod{7}.