2.5 Number Theory

Find the smallest positive integer \(n\) that satisfies the following congruences:
\(n \equiv 2 \pmod{5}\)
\(n \equiv 3 \pmod{7}\)
\(n \equiv 4 \pmod{11}\).

♡ 0 Show solutions

Not logged in? Click here to log in.