Modular Inverse Calculator

Find a⁻¹ mod m

All Tools

Loading tool...

About Modular Inverse Calculator

A modular inverse calculator that finds x such that ax ≡ 1 (mod m) using the extended Euclidean algorithm. Shows GCD computation steps, Bézout coefficients, and verifies the result. Handles cases where no inverse exists (gcd(a,m) ≠ 1). All calculations are client-side. Essential for cryptography, number theory, and modular arithmetic.

Modular Inverse Calculator Features

  • a⁻¹ mod m
  • Ext. Euclidean
  • Bézout coeffs
  • Verification
  • Step-by-step

More Calculators Tools

Explore all 639 other calculators tools available on Generatr

1-Sample Z-Test Calculator2-Sample Z-Test Calculator3D Surface Area CalculatorA/B Testing Significance CalculatorAbsolute Value CalculatorAbundant Number CheckerAccelerated Aging CalculatorAchromatic Number CalculatorAcyclic Chromatic Number CalculatorAdditive Persistence CalculatorAge CalculatorAging Test CalculatorAlbertson Index CalculatorAlgebraic Connectivity CalculatorAliquot Sequence CalculatorAliquot Sum CalculatorAlternating Series Test CalculatorAmicable Number FinderAnnuity CalculatorAPY CalculatorAquarium CO2 Drop CheckerArea CalculatorArea Under Curve CalculatorArithmetic Sequence CalculatorArmstrong Number CalculatorASCVD Risk CalculatorAspect Ratio CalculatorAtom Bond Connectivity CalculatorAugmented Eccentric Connectivity CalculatorAugmented Zagreb Index Calculator
View all 639 calculators tools
Advertisement
Advertisement