GCD & LCMhard
0:00.0

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