Modular Arithmetichard
0:00.0

Find the smallest x>0x > 0 such that x1(mod2),x2(mod3),x3(mod5),x4(mod7)x \equiv 1 \pmod 2, x \equiv 2 \pmod 3, x \equiv 3 \pmod 5, x \equiv 4 \pmod 7.