Multiplicative inverse: Difference between revisions
Created page with "In Modular arithmetic, y is the multiplicative inverse of x if: <cmath>xy \equiv 1 (mod m)</cmath> and if x is not relatively prime to m" |
No edit summary |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Line 1: | Line 1: | ||
In Modular arithmetic, y is the multiplicative inverse of x if: | In Modular arithmetic, y is the multiplicative inverse of x if: | ||
<cmath>xy \equiv 1 (mod m)</cmath> | <cmath>xy \equiv 1 (\text{mod m})</cmath> | ||
and if x is not relatively prime to m | and if x is not relatively prime to m | ||
This is equivalent to the [[Modular_inverse|modular inverse]]. | |||
{{stub}} | |||
Latest revision as of 16:18, 26 June 2025
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 the modular inverse.
This article is a stub. Help us out by expanding it.
