Finding the Modular Inverse using Extended Euclidean algorithm Finding the Modular Inverse using Binary Exponentiation Finding the modular inverse for prime moduli using Euclidean Division Finding the modular inverse for array of numbers modulo $m$ Practice Problems Linear Congruence Equation Chinese...
Take modulo m on both sides, and we get ax + my = 1(mod m) We can remove the second term on the left side as ‘my (mod m)’ because, for an integer, y will be 0. So it becomes, ax ≡ 1 (mod m) So, the value of x can be found using the extended Euclidean algorithm,...