Modular Inverses
a⁻¹ mod n exists iff gcd(a,n)=1.
Key idea
a⁻¹ mod n exists iff gcd(a,n)=1.
In depth
a has an inverse mod n iff gcd(a, n) = 1. Then a·a⁻¹ ≡ 1 (mod n), found by the extended Euclidean algorithm. It permits division in modular arithmetic.
Worked example
3⁻¹ mod 7 = 5, since 3 × 5 = 15 ≡ 1.
Formula
Real-world uses
- Decrypting RSA messages and dividing in modular systems used in computing
Common mistake
Looking for an inverse when gcd(a, n) > 1.
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 Modular Inverses?
a⁻¹ mod n exists iff gcd(a,n)=1. It is a topic at the expert level in Discrete Math & Number Theory.
What is the formula for Modular Inverses?
The key formula is a·a⁻¹ ≡ 1 (mod n).
Where is Modular Inverses used in real life?
Real-world examples: Decrypting RSA messages and dividing in modular systems used in computing.
What should I learn before Modular Inverses?
Make sure you are comfortable with Modular Arithmetic, the previous topic in Discrete Math & Number Theory.
What is a common mistake with Modular Inverses?
Looking for an inverse when gcd(a, n) > 1.
How can I practise Modular Inverses?
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 Modular Inverses?
Move on to Linear Congruences 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.