Difference between revisions of "Modular inverse"

(Created page with "In Modular arithmetic, y is the multiplicative inverse of x if: <cmath>xy \equiv 1 (\text{mod m})</cmath> and if x is not relatively prime to m")
 
 
Line 1: Line 1:
In Modular arithmetic,  y is the multiplicative inverse of x if:
+
In Modular arithmetic,  y is the modular inverse of x if:
  
 
<cmath>xy \equiv 1 (\text{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

Latest revision as of 16:45, 4 August 2021

In Modular arithmetic, y is the modular inverse of x if:

\[xy \equiv 1 (\text{mod m})\]

and if x is not relatively prime to m