Logo

Solve the system of following congruences using Chinese Remainder theorem. \(x \equiv 2 \pmod{3}\) \(x \equiv 3 \pmod{5}\) \(x \equiv 2 \pmod{7}\)

BIT Discrete Structure · 2080 · Solved Question with Answer

Solve the system of following congruences using Chinese Remainder theorem.

\(x \equiv 2 \pmod{3}\)

\(x \equiv 3 \pmod{5}\)

\(x \equiv 2 \pmod{7}\)

Solution

Please login to view the answer.