Multiplicative Inverse Calculator - Real, Fraction, Modular Inverse

A multiplicative inverse calculator computes the reciprocal of any non-zero real number, the flipped form of any fraction, and the modular inverse a⁻¹ (mod n) used in number theory. The multiplicative inverse of a value a is the unique value that returns 1 when multiplied by a, so the calculator always reports both the inverse and the verification product a × inverse. You can switch between real numbers, fractions, and modular inputs in one screen, so the same tool covers algebra homework, dividing by a constant, and modular arithmetic in cryptography or coding theory.

• • Solve linear equations: Solve 5x = 1 by reading x = 1/5 directly, or generalize to any constant divisor.
• • Divide by a constant: Convert 84 / 7 into the multiplication 84 × (1/7) so you can simplify by hand.
• • Compute modular inverses: Find a⁻¹ mod n for cryptography, hash-table probing, and Chinese-remainder problems.
• • Flip a rational expression: Invert a fraction like (x + 1) / (x + 2) by swapping numerator and denominator before simplifying.

The mathematical idea behind the calculator is one equation: a · a⁻¹ = 1. Every mode is just a different way to express that identity. Real-number mode prints 1/x, fraction mode swaps numerator and denominator, and modular mode solves a · x ≡ 1 (mod n) using the extended Euclidean algorithm.

Use the calculator whenever a problem hands you a value a and asks for the thing that cancels it out, for division by an unusual constant, or for any modular-arithmetic step. The verification row confirms a × inverse, so you can check the identity holds before using the value downstream.

When the inverse you need is the additive inverse −a rather than the multiplicative inverse 1/a, the absolute value calculator handles the negation side of the inverse family.

The calculator follows three short workflows depending on which mode you pick. The goal in every case is to return a value that, when multiplied by the input, equals 1 in real or modular arithmetic.

• a: The input value whose inverse you are looking for. Must be non-zero in real and fraction modes.
• a⁻¹: The multiplicative inverse, often written as 1/a, b/a, or x (mod n).
• n: The modulus in Modular mode. Must be a positive integer at least 2.

In Real mode the calculator parses the input as a floating-point number, rejects exactly 0, and computes 1 / a with 10 significant digits. The symbolic-form row then runs a continued-fraction approximation against a 10 000-denominator cap so the displayed fraction stays compact (1/3 instead of 0.333…).

In Modular mode the calculator first checks that a and n share no common factor (gcd(a, n) must equal 1). If they do not, no multiplicative inverse exists in Z/nZ and the tool returns a clear status. Otherwise it runs the extended Euclidean algorithm to recover the coefficient x with a · x + n · y = 1, and x is the modular inverse.

According to Khan Academy, the reciprocal (multiplicative inverse) of a non-zero number a is 1/a, and a × (1/a) = 1

When the input is itself a fraction and you also need to add, subtract, or simplify it, the fraction calculator handles the wider arithmetic on the same numerator and denominator.

Four ideas come up over and over when working with multiplicative inverses. Internalize them and every mode of the calculator becomes obvious.

These four rules are the same ones mathematicians use to decide whether a candidate x is a multiplicative inverse. If a · x equals 1 (or is congruent to 1 modulo n), you can call x the inverse.

Flipping between real, fraction, and modular inputs does not change the identity a · a⁻¹ = 1, only the number system in which the multiplication is performed.

When a modular arithmetic problem also requires the remainder or a modular exponent, the modulo calculator sits next to this tool and uses the same modulus n.

Pick a mode, fill in the value the mode needs, and read the inverse plus the verification row that proves a · inverse = 1. The steps below walk through each mode.

1. 1 Choose a mode: Use the Mode dropdown to pick Real (1/x), Fraction (a/b), or Modular (a mod n).
2. 2 Enter your input value: Type a into the Number field for Real or Modular mode. For Fraction mode, type the numerator and the denominator.
3. 3 For Modular mode, also enter the modulus: The Modulus field must be a positive integer at least 2. Choose a modulus coprime with a so an inverse exists.
4. 4 Read the inverse and the symbolic form: The first result card shows the inverse, while the second row gives a compact form such as 1/4, 7/3, or 4 (mod 11).
5. 5 Confirm the verification product: The verification row shows a × inverse. For Real and Fraction modes it should equal 1; for Modular mode it should equal 1 (mod n). A different value means the input is invalid and the status row explains why.

Example: type Mode = Real, a = 0.5. The calculator reports Inverse = 2, symbolic form = 2/1, verification = 1, and status = valid. Because 0.5 × 2 = 1, 2 is the correct multiplicative inverse.

If the real-mode inverse is an awkward decimal that you would rather reuse as a fraction, the decimal to fraction calculator converts the same value into a simplified a/b form for the next step.

A purpose-built inverse tool saves time and prevents the slip-ups that happen when reciprocals are computed by hand. The benefits below show up in homework, teaching, and real engineering work.

• • Three modes in one tool: Real, fraction, and modular inputs share one screen, so you do not need a separate modular-arithmetic page for cryptography homework.
• • Built-in verification step: The verification row computes a × inverse, so you can spot sign errors, missing minus signs, or wrong modular residues in seconds.
• • Coprimality check for modular mode: The tool refuses to return a fake modular inverse when gcd(a, n) is greater than 1, which is the exact condition that decides whether a⁻¹ mod n exists.
• • Auto-simplified symbolic form: Real-number results come back as a simplified fraction (1/4 instead of 0.25) so you can paste the answer into a worked-solution write-up without round-tripping through a fraction calculator.
• • Works with negative inputs: Negative numbers, negative fractions, and negative modular residues are all supported, so the calculator covers the sign-preserving identity a · a⁻¹ = 1 in every case.

These benefits are most useful when the inverse is one small piece of a larger expression. Verifying the inverse on the spot keeps you moving without opening a separate tool, and the symbolic form gives a result ready for the next algebraic manipulation.

If you teach multiplicative inverses, the same calculator works for in-class examples and student practice, because the fields, formula box, and verification row all align with the textbook definition a · a⁻¹ = 1.

To re-check the verification row a × inverse = 1 by hand, the multiplication calculator lets you multiply any two numbers with the same precision as the calculator.

Most inputs return a clean inverse, but a few properties of the input and the arithmetic can change the answer.

• • Real-number inverses of irrationals (such as 1/7) cannot be written as a finite decimal; the symbolic form is exact up to a 10 000-denominator cap.
• • Modular mode is restricted to positive integer a and n ≥ 2. Negative residues and rational moduli are out of scope.

If you need higher precision for irrational reciprocals, the symbolic form row is the safest output: 1/7 is exact even when the decimal row is rounded. For modular arithmetic, the extended Euclidean algorithm matches textbook cryptography examples.

Treat the verification row as your safety check. A verification value of 1 (or 1 mod n) confirms a · a⁻¹ = 1 holds in your number system.

According to Wikipedia (Modular Multiplicative Inverse), an integer a has a modular inverse mod n if and only if gcd(a, n) = 1, found with the extended Euclidean algorithm

According to Wolfram MathWorld, the multiplicative inverse of a in a group is a⁻¹ with a · a⁻¹ = 1, and 0 has no inverse in the reals

If the relationship you are studying is xy = k instead of a · a⁻¹ = 1, the inverse variation calculator applies the same reciprocal identity to two variables.