Inverse Modulo Calculator
Modular Multiplicative Inverse
The modular multiplicative inverse of an integer 'a' modulo 'm' is an integer 'x' such that:
\( (a \cdot x) \equiv 1 \pmod{m} \)
This is equivalent to finding an 'x' that satisfies the equation \(ax + my = 1\) for some integer 'y'.
An inverse only exists if 'a' and 'm' are coprime (their greatest common divisor is 1).
This calculator uses the Extended Euclidean Algorithm to find the coefficients 'x' and 'y', where 'x' is the modular inverse.
Disclaimer: This calculator is for educational purposes only. While we strive for accuracy, please verify all results for critical applications.
Finds the inverse of \(a \pmod{m}\).
Powered by: Calco