Select the type and enter the number in the designated field, and the calculator will instantly determine the inverse modulo, with detailed calculations shown.
Related
Use this free inverse modulo calculator to quickly compute the modular inverse of any integer. It simplifies complex calculations for additive and multiplicative inverses.
An integer x is called the inverse modulo of a given integer a if applying a specific operation between x and a produces the identity element.
Two integers x and y are congruent modulo n if they have the same remainder when divided by n:
Generic representation: a ≡ b (mod n)
The additive identity is 0. The additive inverse modulo satisfies:
a + x ≡ 0 (mod m)
The multiplicative identity is 1. The modular multiplicative inverse satisfies:
a * x ≡ 1 (mod m)
Check all integers x ∈ {0, 1, ..., m-1}. The integer x that satisfies a * x ≡ 1 (mod m) is the multiplicative inverse. The calculator automates this efficiently.
Uses Bézout’s identity:
Applying modulo m: a * x ≡ 1 (mod m)
If m is prime and a is not divisible by m:
a^(m-1) ≡ 1 (mod m)
Thus, the multiplicative inverse of a modulo m is: a^(m-2) mod m
Input:
Output:
The modular inverse is 15. You can verify this using the calculator.
The additive inverse is the negative of a number that, when added to the original number, yields 0 modulo m.
Generic representation: a + (-a) ≡ 0
The modular inverse is 927, which can also be verified with the calculator.
Inverse modulo is essential for solving linear congruences and cryptography problems. The inverse modulo calculator simplifies these calculations and provides accurate results with step-by-step guidance.
Related
Links
Home Conversion Calculator About Calculator Online Blog Hire Us Knowledge Base Sitemap Sitemap TwoEmail us at
Contact Us© Copyrights 2026 by Calculator-Online.net