Congruences and the Chinese remainder theorem

Sign up free to unlock this topic

Kindergarten is free, and guests can try one sample topic in every other grade. A free parent or teacher account opens every topic from Kindergarten to Grade 12, college and university, and saves progress. No credit card.

Try the free sample: The ideal gas law · Have a class or homeroom code? Join here

Key idea: Congruences and the Chinese remainder theorem

Solve ax ≡ b (mod m) by multiplying by the inverse of a. The Chinese remainder theorem: congruences with coprime moduli have exactly one common solution mod their product. Fermat: a^(p−1) ≡ 1 (mod p) for prime p.

Key words

CRT
One answer mod m₁m₂.
Fermat
Reduce exponents mod p − 1.

🔎 What to look for: Check that a and m are coprime before looking for an inverse.

Zero2Hero — Zéro2Héros