mod n (n is prime number)
x * y ≡ 1 mod n (y is an MI of mod n)
Note:
x and n have to be coprime i.e. GCD(x, n) = 1
(2 is MI of 3 or 2 is MI of 3 mod 5)
Source • Blame • Git History
mod n (n is prime number)
x * y ≡ 1 mod n (y is an MI of mod n)
Note:
x and n have to be coprime i.e. GCD(x, n) = 1
(2 is MI of 3 or 2 is MI of 3 mod 5)