Difference between revisions of "Multiplicative inverse"

(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")
 
 
(One intermediate revision by the same user 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 this: https://artofproblemsolving.com/wiki/index.php/Modular_inverse

Latest 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})\]

and if x is not relatively prime to m


This is equivalent to this: https://artofproblemsolving.com/wiki/index.php/Modular_inverse