Modular Arithmetichard
0:00.0

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