Guest Session: 1 Question Remaining. Create Account to save progress.
Login
Modular Arithmetichard
0:00.0

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