Difference between revisions of "Multiplicative inverse"
| Line 4: | Line 4: | ||
and if x is not relatively prime to m | and if x is not relatively prime to m | ||
| + | |||
| + | |||
| + | This is equivalent to this: https://artofproblemsolving.com/wiki/index.php/Modular_inverse | ||
Revision as of 15:46, 4 August 2021
In Modular arithmetic, y is the multiplicative inverse of x if:
![\[xy \equiv 1 (\text{mod m})\]](http://latex.artofproblemsolving.com/0/f/2/0f2556ddbddb57a37ab2bef984d200b4c7d2cd86.png)
and if x is not relatively prime to m
This is equivalent to this: https://artofproblemsolving.com/wiki/index.php/Modular_inverse
