Search results
Make use of the free inverse modulo calculator that allows you to calculate the modular inverses of any random number.
Tool to compute the modular inverse of a number. The modular multiplicative inverse of an integer N modulo m is an integer n such as the inverse of N modulo m equals n.
The online calculator for the (Extended) Euclidean Algorithm. It shows intermediate steps!
This calculator calculates modular multiplicative inverse of an given integer a modulo m.
This inverse modulo calculator calculates the modular multiplicative inverse of a given integer a modulo m.
To solve such equations, you first consider the case with $\gcd(a,m)=1$, in which case $ax\equiv b\pmod{m}$ is solved either by finding the multiplicative inverse of $a$ modulo $m$, or as I did in method $2$ above looking at $\frac{b}{a}$.
How to find a modular inverse. A naive method of finding a modular inverse for A (mod C) is: step 1. Calculate A * B mod C for B values 0 through C-1. step 2. The modular inverse of A mod C is the B value that makes A * B mod C = 1. Note that the term B mod C can only have an integer value 0 through C-1, so testing larger values for B is redundant.
