Formula Used
The modular inverse formula finds a value x where:
(a × x) mod m = 1
The calculator uses the Extended Euclidean Algorithm. It solves ax + my = gcd(a,m). When gcd equals one, x becomes the inverse value.
How to Use This Calculator
Enter the number value inside the first field. Enter the modulus value inside the second field. Press the calculate button to get the answer.
The calculator checks whether an inverse exists. It displays the inverse when numbers are coprime.
Example Data
| Number | Modulus | Inverse |
|---|---|---|
| 3 | 11 | 4 |
| 7 | 15 | 13 |