Extended Euclidean Algorithm
can be used to calculate the gcd of two numbers a and b
to calculate the the multiplicative inverse modulo n of a number a.
Previous slide
Next slide
Back to first slide
View graphic version