2.0 Algebra Number Theory

Chinese Remainder Theorem with Prime Moduli

Author: SolveSheep

Find the smallest positive integer \(x\) that satisfies the following system of congruences:
\(x \equiv 3 \pmod 5\)
\(x \equiv 5 \pmod 7\)
\(x \equiv 7 \pmod{11}\)




Not logged in? Click here to log in.