Find the modular multiplicative inverse of an integer a modulo m, i.e., the integer x such that a × x ≡ 1 (mod m).
Find the modular multiplicative inverse of an integer a modulo m, i.e., the integer x such that a × x ≡ 1 (mod m).
The integer to find the inverse of
The modulus (must be > 1)
The modular inverse exists if and only if gcd(a, m) = 1. Computed using the Extended Euclidean Algorithm.
How this calculator works
The modular inverse exists if and only if gcd(a, m) = 1. Computed using the Extended Euclidean Algorithm.
Common questions about this calculator
