Understand why↗
5 has no inverse modulo 10 because the greatest common divisor of 5 and 10 is 5, which is not 1. According to the existence theorem, an integer has an inverse modulo m if and only if their gcd is 1.
Conditions: Modulus is 10.; Number whose inverse is requested: 5.
YouTubeFinding Modular Inverses
4:14 – 4:59Watch this moment ↗
5 has no inverse modulo 10 because the greatest common divisor of 5 and 10 is 5, which is not 1. According to the existence theorem, an integer has an inverse modulo m if and only if their gcd is 1.
Conditions: Modulus is 10.; Number whose inverse is requested: 5.
YouTubeFinding Modular Inverses
4:14 – 4:59Watch this moment ↗