Multiplicative Inverse Modulo Calculator
Result
Multiplicative Inverse mod n Find multiplicative inverse modulo n. Formula: Find x such that (a × x) ≡ 1 (mod n). Used in cryptography. Requires GCD(a, n) = 1. — free online calculator.
Formula
- Multiplicative Inverse Modulo Calculator calculates its result from a, Modulus. It uses the formula Find x: (a × x) ≡ 1 (mod n) using Extended Euclidean Algorithm. Change any input to recalculate the result instantly.
- The main inputs are a, Modulus. Enter them in the units and format shown in the calculator.
- Keep comparable quantities in compatible units whenever the formula combines or compares them.
- Changing any input above recalculates the result with the same calculation engine used by this page.
Example: Multiplicative Inverse Modulo
- a: 3
- Modulus: 11
Using a = 3, Modulus = 11, the calculated result is 4.
Sample result: Calculating…
Frequently asked questions
What does the Multiplicative Inverse Modulo calculate?
Multiplicative Inverse mod n Find multiplicative inverse modulo n. Formula: Find x such that (a × x) ≡ 1 (mod n). Used in cryptography. Requires GCD(a, n) = 1. — free online calculator.
Which values should I enter?
Enter a, Modulus using the units and format shown beside each field.
What formula does this calculator use?
The calculator uses the following relationship: Find x: (a × x) ≡ 1 (mod n) using Extended Euclidean Algorithm.
Why might my result differ from another source?
Results can differ when another source uses different units, rounding rules, conventions or assumptions. Compare the inputs and definitions before comparing results.
Does the result update automatically?
Yes. Changing an input updates the result using the same calculation engine shown on this page.