Modular Inverse Calculation
Given coprime integers a and m, calculates the integer x (=a-1) satisfying a * x = 1 (mod m), using the extended Euclidean algorithm.
| \( ax \equiv a a^{-1} \equiv 1\ \pmod m \) |
| Modular Inverse a-1 |
No customer feedback for this calculation yet.