Solve the following linear congruence using Chinese Remainder Theorem. \(x \equiv 1 \pmod 5\) \(x \equiv 2 \pmod 7\)
2024 · Solved Question with Answer
Solve the following linear congruence using Chinese Remainder Theorem.
\(x \equiv 1 \pmod 5\)
\(x \equiv 2 \pmod 7\)