Modular Inverse Solver
ModulusMediumCalculate modular multiplicative inverses using Extended Euclid or Fermat's Little Theorem.
Alt+Shift+9
Configuration Panel
Complexity Indices
Time ComplexityO(log M)
Auxiliary SpaceO(log M)
Conceptual Overview
Modular Multiplicative Inverse is an integer x satisfying: ax ≡ 1 mod m. It exists if and only if a and m are coprime (gcd(a, m) = 1).
Source: CP-Algorithms reference guide