Guest Session: 1 Question Remaining. Create Account to save progress.
Login
GCD & LCMhard
0:00.0

Find the smallest positive integer nnn such that n≡3(mod7)n \equiv 3 \pmod 7n≡3(mod7), n≡5(mod8)n \equiv 5 \pmod 8n≡5(mod8), and n≡2(mod9)n \equiv 2 \pmod 9n≡2(mod9).