Multiplicative Inverse Modulo Calculator

How to Use the Calculator

1. Enter the number \(a\) in the Number (a) field — the value you want the inverse for.
2. Enter the modulus in the Modulo (n) field. It must be greater than 1.
3. Read the Multiplicative Inverse result — the value \(x\) with \(a \cdot x \equiv 1 \pmod{n}\).
4. Check the Check line, which shows the verification \(a \times x \equiv 1 \bmod n\).

If \(a\) and \(n\) share a common factor greater than 1, the calculator reports that the inverse does not exist, because no multiple of \(a\) can ever be congruent to 1 modulo \(n\).

What Is a Modular Multiplicative Inverse?

In ordinary arithmetic, the inverse of a number is its reciprocal: the inverse of 3 is \(1/3\), because \(3 \cdot 1/3 = 1\). Modular arithmetic has no fractions, so the multiplicative inverse is defined differently. The inverse of \(a\) modulo \(n\) is an integer \(x\) such that

\[ a \cdot x \equiv 1 \pmod{n} \]

In other words, when you multiply \(a\) by \(x\) and divide by \(n\), the remainder is exactly 1. For example, \(3 \times 4 = 12\), and 12 leaves a remainder of 1 when divided by 11, so 4 is the inverse of 3 modulo 11. Every number coprime with the modulus has exactly one inverse in the range \(0\) to \(n-1\).

This concept matters because modular "division" is really multiplication by the inverse. To solve \(a \cdot x \equiv b \pmod{n}\), you multiply both sides by the inverse of \(a\) — the same move as dividing both sides of an ordinary equation, but done in a way that stays within integers.

Modular inverses are also central to cryptography. RSA key generation computes the private exponent as the inverse of the public exponent modulo \(\varphi(n)\); Diffie–Hellman and elliptic-curve schemes rely on inverses in finite fields. Beyond cryptography, inverses appear in error-correcting codes, hashing, and number-theoretic problems solved with tools like the Chinese Remainder Theorem.

When the Inverse Exists (and When It Doesn't)

An inverse of \(a\) modulo \(n\) exists if and only if \(\gcd(a, n) = 1\). Two numbers with a gcd of 1 are called coprime or relatively prime. The reason is visible in the Extended Euclidean identity: it can only produce \(a \cdot x + n \cdot y = 1\) when 1 is a combination of \(a\) and \(n\), which happens precisely when their gcd is 1.

For example, 6 has no inverse modulo 9, because \(\gcd(6, 9) = 3\): every multiple of 6 is divisible by 3, so it can never leave a remainder of 1. But 6 does have an inverse modulo 11, since \(\gcd(6, 11) = 1\).

A useful shortcut: when the modulus \(n\) is a prime, every \(a\) from 1 to \(n-1\) has an inverse, because no number smaller than a prime shares a factor with it. In that special case the inverse can also be computed with Fermat's Little Theorem as \(a^{n-2} \bmod n\); for composite moduli, Euler's Theorem gives the analogous result \(a^{\varphi(n)-1}\)

Limitations and Practical Notes

• The calculator requires \(n > 1\); modulo 1 every number is congruent to 0 and an inverse is meaningless.
• Enter a positive \(a\). If you need the inverse of a negative number, reduce it first: the inverse of \(-a\) equals the inverse of \(n - a\).
• The result is always returned in the range \(0 \le x < n\), which is the standard representative of the solution.
• For very large numbers (hundreds of digits, as in real cryptographic work), browser-based computation reaches its limits; this calculator is intended for everyday and educational use.
• The Extended Euclidean Algorithm runs in logarithmic time, so even large hand-scale inputs are handled instantly — there is no need to test candidate values one by one.