Modular Arithmetichard
0:00.0

Find the smallest positive integer xx such that x3(mod4)x \equiv 3 \pmod{4}, x5(mod6)x \equiv 5 \pmod{6}, and x7(mod9)x \equiv 7 \pmod{9}.