Chinese Remainder Theorem
Solve systems of congruences with coprime moduli.
Key idea
Solve systems of congruences with coprime moduli.
In depth
If moduli are pairwise coprime, the system x ≡ aᵢ (mod nᵢ) has a unique solution modulo the product. Combine congruences one at a time or use the inverse formula.
Worked example
x ≡ 2 (mod 3), x ≡ 3 (mod 5): x = 8 (mod 15).
Real-world uses
- Reconstructing a number from remainders, used in speeding up large computer calculations
Common mistake
Applying it to moduli that are not coprime without a compatibility check.
How to learn this
- Read the key idea and say it in your own words.
- Work through the worked example, then try a similar problem.
- Use the interactive lesson’s visual and mini-quiz to check the pattern.
Frequently asked questions
What is Chinese Remainder Theorem?
Solve systems of congruences with coprime moduli. It is a topic at the expert level in Discrete Math & Number Theory.
Where is Chinese Remainder Theorem used in real life?
Real-world examples: Reconstructing a number from remainders, used in speeding up large computer calculations.
What should I learn before Chinese Remainder Theorem?
Make sure you are comfortable with Linear Congruences, the previous topic in Discrete Math & Number Theory.
What is a common mistake with Chinese Remainder Theorem?
Applying it to moduli that are not coprime without a compatibility check.
How can I practise Chinese Remainder Theorem?
Open the interactive lesson, play with the visual, then answer the three-question mini-quiz. Getting two right marks the topic complete.
What comes after Chinese Remainder Theorem?
Move on to Fermat’s Little Theorem next.
Related expert topics in Discrete Math & Number Theory
- Strong Induction – Assume all earlier cases to prove the next.
- Well-Ordering Principle – Every nonempty set of positive integers has a least element.
- Partial Orders – Reflexive, antisymmetric, transitive relations.
- Cardinality of Sets – Comparing sizes of infinite sets.
- Countable and Uncountable Sets – ℕ and ℚ are countable; ℝ is not.
- Cantor’s Diagonal Argument – Proof that real numbers are uncountable.