Modular Inverse Calculator: inspect an exact integer result
Find an exact multiplicative inverse for a signed integer modulo an integer greater than one, when it exists. Enter the labeled integer fields and choose Calculate. Load example (replaces inputs) supplies a reproducible case; it clears any earlier result.
Work through the example
For number 3 and modulus 11, the inverse is 4. The verification residue is 1 because 3 × 4 = 12 and 12 mod 11 = 1.
Calculation convention
The extended Euclidean algorithm computes an inverse when the greatest common divisor is one. Negative numbers are first reduced to their nonnegative residue. The result is the representative from zero through modulus minus one; other equivalent integers differ by multiples of the modulus.
Supported inputs and limitations
Number 6 modulo 9 has no inverse and produces an explicit error, since their GCD is 3. Zero also has no inverse for the supported moduli. This is modular multiplication, not ordinary reciprocal calculation or floating-point division. Modulus one is excluded.
Enter signed decimal integers with at most 30 digits in each field. Decimals, exponent notation and grouping commas are not accepted. For example, use 1000, not 1e3. Copy results includes the normalized input residue, inverse and verification residue. Editing either number clears the previous answer.
Use Modulo Calculator to inspect a residue or Greatest Common Divisor Calculator to understand why an inverse does not exist.





