← Quiz: Number Theory: all 9 questions
Quiz: Number Theory · Question 3 of 9
When does a modulo m have a multiplicative inverse?
When does a modulo m have a multiplicative inverse?
- A.Always
- B.When a is prime
- C.When gcd(a, m) = 1
- D.When m is even
Answer & explanation
Correct answer: When gcd(a, m) = 1
Extended Euclid finds x with ax ≡ 1 (mod m) exactly when a and m are coprime.
Can you get the rest right without peeking?
Take the timed Quiz: Number Theory quiz free. Pass it to earn XP and count towards your certificate.
Start the quiz →