Inverse Modulo Calculator
Calculator for the modular multiplicative inverse
This function calculates the multiplicative inverse x from an integer a and modulo m.
To calculate, enter the integers a and m, then click the 'Calculate' button.
|
Description
The modular multiplicative inverse of a modulo m only exists:
if \(a\) and \(m\) are relatively prime \(gcd(a, m) = 1\).
In the standard notation of modular arithmetic this congruence is written as
\(ax ≡ 1 (mod \ m)\)
More information you can find by Wikipedia.
Absolute Change
•
All divisors of an integer
•
Average
•
Binomial formulas
•
Common divisors of two integers
•
Consecutive integers
•
Cross multiplication
•
Diamond problem
•
Digit sum
•
Digital root
•
Direct variation
•
Division with remainder
•
Elementary arithmetic
•
Factorial
•
FOIL Method
•
Inverse cross multiplication
•
Inverse modulo
•
Greatest common divisor
•
Least common multiple
•
Modulo
•
Multiplicative inverse
•
Relative Change
|
|