Modular Arithmetichard
0:00.0

Find the smallest positive integer xx such that x2(mod3)x \equiv 2 \pmod{3}, x3(mod5)x \equiv 3 \pmod{5}, x2(mod7)x \equiv 2 \pmod{7}.