Multiplying Fractions Calculator
Multiply two fractions with the cross-cancellation shortcut shown step by step — cancel common factors first, then multiply straight across.
Multiplying Fractions Calculator
Background.
This multiplying fractions calculator does not just multiply straight across and reduce at the end — it applies cross-cancellation first, the shortcut every pre-algebra textbook teaches for keeping the numbers small, and reports every step as a real, readable value. Enter 4/9 × 3/8 and it shows crossCancelGcdA = 4 (the factor shared by the first numerator, 4, and the second denominator, 8), crossCancelGcdB = 3 (the factor shared by the second numerator, 3, and the first denominator, 9), the four cancelled terms n1Reduced = 1, d2Reduced = 2, n2Reduced = 1, d1Reduced = 3, and finally the answer, 1/6, reached by multiplying the already-small cancelled terms straight across instead of first computing the much larger 12/72 and reducing afterward.
Quanta's general-purpose fraction calculator (math/fraction) also multiplies fractions, but its own documentation explicitly rejects cross-cancellation as a method — it multiplies numerators and denominators straight across first, at full size, and simplifies only once at the very end, with no cancellation step exposed anywhere in its output. That is a perfectly valid way to reach the correct answer, but it is not the technique most students are taught to use, and it produces larger intermediate numbers than necessary. This calculator exists specifically to show the cross-cancellation method: find what a numerator and the opposite denominator have in common, divide both by it before multiplying, and only then multiply the now-smaller terms straight across.
Cross-cancellation works because multiplication of fractions is commutative and associative, so (a/b) × (c/d) can be regrouped as (a/d) × (c/b) without changing the answer — and if a and d share a common factor, cancelling it there is mathematically identical to cancelling it after the full multiplication, just with smaller numbers along the way. Concretely: a numerator from one fraction may share a common factor with the denominator of the OTHER fraction (not its own), and dividing both by that shared factor before multiplying reduces the arithmetic you have to do. This is why the technique is sometimes called 'cross-cancelling' — the cancellation crosses between the two fractions rather than staying within one.
The method has three steps, each reported individually by this calculator. First, find the greatest common divisor of the first numerator and the second denominator, and divide both by it. Second, find the greatest common divisor of the second numerator and the first denominator, and divide both by it. Third, multiply the four now-reduced terms straight across — numerator times numerator, denominator times denominator — which by construction produces an answer that is very often already in lowest terms, though this calculator still performs one final safety-net reduction in case the original fractions were not fully reduced to begin with (for example, if you enter 4/6 instead of 2/3).
This calculator also handles the arithmetic details that complicate manual cross-cancellation: negative numerators and denominators (signs are normalised before cancelling, so the denominator you cancel against is always positive), a zero numerator (which cancels the entire opposite denominator down to 1 and produces a final answer of exactly 0), and cases where no cancellation is available at all (the cross-cancel factors both come out as 1, and the calculator still multiplies straight across correctly). Whether you're checking homework that specifically asks you to show the cross-cancellation step, scaling a recipe by a fractional multiplier, or just want to see the shortcut applied transparently to your own numbers, this page and the calculator above cover the single operation of fraction multiplication with the method searchers actually expect.
What is multiplying fractions calculator?
Multiplying two fractions n1/d1 and n2/d2 means finding a single fraction equal to (n1 × n2)/(d1 × d2) — unlike addition, no common denominator is required, because multiplication of fractions is defined directly on the numerator-denominator pairs without needing to compare pieces of the same size first. Cross-cancellation is an optional, order-preserving shortcut applied before that multiplication: because a/b × c/d can be regrouped as a/d × c/b (multiplication of fractions is commutative and associative), any common factor between a numerator and the OPPOSITE fraction's denominator can be divided out first without changing the final answer. Concretely, if g₁ = gcd(|n1|, d2), dividing both n1 and d2 by g₁ shrinks those two numbers while leaving the true value of the whole expression unchanged; the same applies to g₂ = gcd(|n2|, d1) for the other cross-pair. After both cancellations, the four remaining terms are multiplied straight across, and the greatest common divisor is defined precisely as the largest such shared factor. When the resulting product's magnitude is 1 or greater, it can equivalently be written as a mixed number — a whole-number part plus a proper fractional remainder, found by ordinary integer division of the numerator by the denominator.
How to use this calculator.
- Enter the first fraction's numerator and denominator in the first pair of fields. Both must be integers, and the denominator must be non-zero.
- Enter the second fraction's numerator and denominator in the second pair of fields. Same rule: integers, non-zero denominator.
- Read the two cross-cancel factors: crossCancelGcdA (shared by the first numerator and the second denominator) and crossCancelGcdB (shared by the second numerator and the first denominator).
- Check the four reduced terms (n1Reduced, d2Reduced, n2Reduced, d1Reduced) to see exactly what each number becomes after cancelling.
- Read the primary result — the simplified product's numerator and denominator — for the final answer.
- Check the decimal value for a quick sense of magnitude, and the mixed-number outputs (isMixed, wholePart, fractionalNumerator) whenever the product's magnitude is 1 or greater.
- If both cross-cancel factors come back as 1, that simply means no shortcut was available for these particular numbers — the straight-across multiplication still proceeds and the final result is still correct.
The formula.
The calculator multiplies two fractions using the cross-cancellation method taught in OpenStax Prealgebra 2e §4.2, in two cancellation steps followed by a straight-across multiplication. First, both fractions are sign-normalised so their denominators are positive — if a denominator was entered as negative, both its numerator and denominator are multiplied by −1, which does not change the fraction's value. Step one: compute g₁ = gcd(|n1|, d2) using the Euclidean algorithm (Euclid, Elements, Book VII, Proposition 2), then divide both n1 and d2 by g₁. This is valid because a/b × c/d = a/d × c/b (fraction multiplication is commutative and associative, so the four terms can be regrouped freely before multiplying), and cancelling a common factor from a/d is the same reduction you would eventually perform after computing the full product, just applied earlier and to smaller numbers. Step two: compute g₂ = gcd(|n2|, d1) the same way, and divide both n2 and d1 by g₂. Step three: multiply the four now-reduced terms straight across — (n1 ÷ g₁) × (n2 ÷ g₂) over (d1 ÷ g₂) × (d2 ÷ g₁) — which, if both original fractions were themselves already in lowest terms, produces a result that needs no further reduction, because every common factor between either numerator and either denominator has already been removed. As a safety net for inputs that were not already fully reduced internally (for example 4/6 × 3/9, where 4/6 itself still shares a factor of 2), the calculator performs one final gcd-based reduction on the straight-across product before reporting the answer, guaranteeing the final result is always in lowest terms regardless of how the inputs were originally written.
A worked example.
Take 4/9 × 3/8 — a textbook cross-cancellation example. The calculator reads n1 = 4, d1 = 9, n2 = 3, d2 = 8; all four pass validation and both denominators are already positive. Step one: g₁ = gcd(|4|, 8). The Euclidean algorithm gives 8 = 2 × 4 + 0, so gcd(4, 8) = 4. Dividing both by 4: n1Reduced = 4 ÷ 4 = 1, d2Reduced = 8 ÷ 4 = 2. Step two: g₂ = gcd(|3|, 9). Since 9 = 3 × 3 + 0, gcd(3, 9) = 3. Dividing both by 3: n2Reduced = 3 ÷ 3 = 1, d1Reduced = 9 ÷ 3 = 3. Step three: multiply the reduced terms straight across: numerator = 1 × 1 = 1, denominator = 3 × 2 = 6. A final safety-net reduction checks gcd(1, 6) = 1, so no further simplification is needed. The answer is resultNumerator = 1, resultDenominator = 6 — that is, 1/6. Compare this to the straight-across method without cancelling: 4 × 3 = 12 over 9 × 8 = 72, giving the raw fraction 12/72, which then requires finding gcd(12, 72) = 12 to reduce to the same 1/6 — the cross-cancellation route reaches the identical answer while never handling a number larger than 9. The decimal value is 1 ÷ 6 ≈ 0.1666666667. Since |1| < 6, the product is proper: isMixed = 0, wholePart = 0, fractionalNumerator = 1. A second illustrative case: 3/4 × 4/3, where cross-cancellation removes everything — g₁ = gcd(3,3) = 3 and g₂ = gcd(4,4) = 4 — leaving 1/1 × 1/1 = 1 exactly, confirming that 3/4 and 4/3 are reciprocals.
Frequently asked questions.
What is cross-cancellation when multiplying fractions?
Why does cross-cancellation work — why is it mathematically valid?
Do I have to cross-cancel, or can I just multiply straight across and simplify at the end?
What if there is nothing to cross-cancel?
What happens if one of the fractions has a numerator of zero?
How do I multiply a fraction by a negative fraction?
How is this different from Quanta's general fraction calculator?
References& sources.
- [1]OpenStax. Prealgebra 2e, §4.2 'Multiply and Divide Fractions'. Rice University, peer-reviewed open-access textbook — the cross-cancellation method this calculator implements.
- [2]Euclid. Elements, Book VII, Proposition 2 (c. 300 BCE). The Euclidean algorithm for the greatest common divisor, used for both cross-cancellation steps and the final safety-net reduction.
- [3]NIST Digital Library of Mathematical Functions, §27.1 ('Functions of Number Theory') — the greatest common divisor and its multiplicative properties underlying the cancellation step.
In this category
Embed
Quanta Pro
Paid features are coming later.
- All 313 calculators remain free
- No billing is enabled