Modular Multiplicative Inverse Calculator
Modular Multiplicative Inverse: a planned Super Calculator tool. Covers a. Stub page: the tool, its formula and a worked example are not published yet.
Modular Multiplicative Inverse Calculator is a planned calculator in the mathematics section of Super Calculator, covering algebra and number theory.
What this calculator will compute
Inputs: a, modulus n and method.
Outputs: modular inverse or a statement that none exists, GCD, Bezout coefficients and verification step.
Formula, recorded as scope and not yet verified against a primary source: Find x with ax congruent to 1 modulo n, which exists only when gcd(a, n) = 1. Computed by the extended Euclidean algorithm, or by Fermat’s little theorem as a^(n-2) mod n when n is prime.
Status
This page is a stub. The calculator is not built, no figure on this page has been verified against the authority that sets it, and nothing here should be used to make a decision. The page exists so that the site structure is complete and so that articles can link this concept on first mention.
The stub carries noindex, nofollow and is excluded from the sitemap.