Multiplicative Inverse

• Euler’s generalization of Fermat’s Little Theorem.

• If gcd(a,n) = 1, then

af(n) mod n = 1

=> a-1 mod n =

Example: 5-1 mod 7

Previous slide

Next slide

Back to first slide

View graphic version