Modular inversion

Use the extended Euclidean algorithm to compute a modular multiplicative inverse


Computes m for n-1 = m (mod p), where n and p are coprime.

Displays the steps of the extended Euclidean algorithm.

Set n =
Set p =

Some examples:


Darren Sri-Jayantha