Calculator for the modular multiplicative inverse
This function calculates the multiplicative inverse x from an integer a and modulo m.
To calculate, enter the integers a and m, then click the 'Calculate' button.
|
The modular multiplicative inverse of a modulo m only exists:
if a and m are relatively prime (gcd(a, m) = 1).
In the standard notation of modular arithmetic this congruence is written as
ax ≡ 1 (mod m)
More information you can find by Wikipedia.
|