Modular Arithmetichard
0:00.0

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