Simplify Fractions Calculator

Background.

This simplify fractions calculator does exactly one job and shows exactly how it did it: type in any numerator and denominator, and it reduces the fraction to lowest terms while reporting the greatest common divisor (GCD) it divided by to get there. Enter 8/12 and it returns 2/3, together with gcdUsed = 4 (because gcd(8, 12) = 4), a flag telling you the fraction was NOT already in lowest terms, the decimal value 0.6666…, and the mixed-number breakdown for any result whose magnitude is at least 1. That distinction — showing the GCD as a first-class number, not just the final reduced fraction — is the entire reason this calculator exists as a dedicated tool rather than a mode inside a general-purpose fraction calculator.

Quanta's own general fraction calculator (math/fraction) is intentionally a different tool: it takes two fractions and an operation (add, subtract, multiply, divide) and returns the simplified result of that operation. It reduces internally as the last step of arithmetic, but it has no path for 'I already have one fraction, I just want to know its lowest-terms form and the GCD that produced it' — there is no single-fraction mode, and the GCD itself is never a declared, readable value anywhere in that calculator's output. This page fills that gap directly: one fraction in, its reduced form and the GCD step out, with nothing else in the way.

Simplifying — also called reducing — a fraction means dividing both the numerator and the denominator by their greatest common divisor, the largest positive integer that evenly divides both. A fraction is in lowest terms (or 'fully reduced') precisely when that GCD equals 1, meaning the numerator and denominator share no common factor greater than 1. The standard, provably fastest way to find that GCD for any two integers — no matter how large — is the Euclidean algorithm: repeatedly replace the larger number with the remainder of dividing it by the smaller, until the remainder reaches zero. The last non-zero value is the GCD. Euclid described this exact procedure in Book VII, Proposition 2 of the Elements around 300 BCE, and it remains the standard method taught in every number theory course and implemented in every computer algebra system today, over 2,300 years later, because nothing faster has ever been found for integers of this size.

Why does reducing a fraction matter beyond tidiness? Three concrete reasons. First, comparison: it is far easier to see that 2/3 and 4/6 are the same number once both are written as 2/3 than while they sit unreduced. Second, arithmetic downstream: adding, multiplying, or comparing fractions is simpler and less error-prone when you start from lowest terms, because the numbers involved stay smaller. Third, communication: a recipe, a blueprint, or a homework answer key almost always expects — and grades against — the reduced form; '4/8 cup' looks like an error where '1/2 cup' looks correct, even though they are the identical quantity.

This calculator handles the details that trip up manual reduction: negative numerators and denominators (the sign is always normalised onto the numerator, so the denominator you see is always positive), zero numerators (0 over anything simplifies to 0/1), and fractions that are already in lowest terms (the wasAlreadyInLowestTerms flag tells you plainly rather than making you guess). Whether you're checking pre-algebra homework, reducing a recipe measurement, simplifying a ratio for a shop-class blueprint, or just want to see the Euclidean algorithm applied to your own numbers step by step, this page and the calculator above cover the single operation of fraction simplification completely, with primary-source citations to Euclid, OpenStax, and the NIST Digital Library of Mathematical Functions.

What is simplify fractions calculator?

A fraction numerator/denominator is in lowest terms (equivalently, fully reduced, or in simplest form) when the greatest common divisor of the numerator's absolute value and the denominator equals 1 — that is, when the two numbers share no common integer factor larger than 1. Simplifying a fraction means finding that greatest common divisor (GCD) and dividing both the numerator and the denominator by it. For example, 8 and 12 share the common divisor 4 (the largest one, since 8 = 4 × 2 and 12 = 4 × 3, and 2 and 3 share no further common factor), so dividing both terms by 4 gives 2/3, which is in lowest terms because gcd(2, 3) = 1. Every rational number has exactly one lowest-terms representation once you additionally require the denominator to be positive — the sign, if any, is carried entirely by the numerator. The standard algorithm for finding the GCD of any two positive integers is the Euclidean algorithm (Euclid, Elements, Book VII, Proposition 2): repeatedly divide the larger by the smaller and replace the larger with the remainder, until the remainder is zero; the last non-zero remainder is the GCD. This method is exponentially faster than the alternative approach of factoring both numbers into primes and comparing exponents, which is why it remains the standard method in both hand calculation and computer software. A special convention handles a zero numerator: gcd(0, d) is defined to equal d for any positive d, so 0/d always reduces cleanly to 0/1.

How to use this calculator.

1. 01Enter the numerator — the top number of your fraction — in the first field. It can be positive, negative, or zero, but it must be a whole number.
2. 02Enter the denominator — the bottom number — in the second field. It must be a non-zero whole number. If you enter a negative denominator, the calculator automatically moves the negative sign onto the numerator so the displayed denominator is always positive.
3. 03Read the primary result: the simplified numerator and simplified denominator. Together they are your fraction in lowest terms — for 8 and 12 that is 2 and 3.
4. 04Check the gcdUsed output to see exactly which number both the original numerator and denominator were divided by. This is the number the Euclidean algorithm computed.
5. 05Look at wasAlreadyInLowestTerms if you're not sure whether your original fraction needed reducing at all — it reads 1 when gcd = 1 (nothing to do) and 0 whenever an actual reduction happened.
6. 06Read the decimal value for a quick sense of magnitude, and the mixed-number outputs (isMixed, wholePart, fractionalNumerator) whenever the simplified fraction's magnitude is 1 or greater.
7. 07Use the human-readable fractionDisplay string directly if you just need the answer written out, such as '2/3' or '-3/4'.

The formula.

Reducing a fraction to lowest terms is a single division step once the greatest common divisor is known: if g = gcd(|n|, d), the lowest-terms fraction is (n ÷ g) / (d ÷ g). What does the work is finding g, and the standard, provably fastest method for two arbitrary integers is the Euclidean algorithm (Euclid, Elements, Book VII, Proposition 2, c. 300 BCE): given positive integers x and y with x ≥ y, replace the pair with (y, x mod y) and repeat until the second value is 0; the first value at that point is gcd(x, y). Correctness follows from one observation, repeated at each step: every common divisor of x and y is also a common divisor of y and x mod y, because x mod y = x − ⌊x/y⌋ · y is an integer combination of x and y — and the argument reverses too, so the set of common divisors, and therefore the greatest one, is unchanged by the substitution. The process terminates because the second value strictly decreases every step (0 ≤ x mod y < y), and Gabriel Lamé proved in 1844 that the number of steps needed is at most about five times the number of decimal digits in the smaller input — so even a denominator in the billions reduces in well under fifty steps. This calculator applies exactly that algorithm to gcd(|numerator|, |denominator|) using the absolute value of the numerator (because the GCD of a negative and a positive integer is defined the same way, and the sign is handled separately). If the denominator you entered was negative, both the numerator and denominator are first multiplied by −1, which does not change the value of the fraction but does move the negative sign onto the numerator and make the denominator positive — the canonical convention every textbook and computer algebra system uses. After that sign normalisation, dividing both terms by g = gcd(|n|, d) yields a fraction that is, by the definition of GCD, in lowest terms: any further common factor greater than 1 would contradict g being the greatest one. The special case n = 0 is handled by the standard convention gcd(0, d) = d, so 0/d always reduces cleanly to 0/1 regardless of d.

A worked example.

Frequently asked questions.

References& sources.

1. [1]Euclid. Elements, Book VII, Proposition 2 (c. 300 BCE). The original statement of the Euclidean algorithm for finding the greatest common measure (divisor) of two numbers. English translation and commentary: Heath, T. L., The Thirteen Books of Euclid's Elements, Cambridge University Press, 1908.
2. [2]OpenStax. Prealgebra 2e, §4.2 'Multiply and Divide Fractions' (learning objective: Simplify Fractions). Rice University, peer-reviewed open-access textbook.
3. [3]NIST Digital Library of Mathematical Functions, §27.1 ('Functions of Number Theory') — the greatest common divisor and its multiplicative properties.
4. [4]Hardy, G. H. and Wright, E. M. An Introduction to the Theory of Numbers, 6th edition, revised by Heath-Brown and Silverman. Oxford University Press, 2008. §1.1 establishes divisibility, the GCD, and the uniqueness of lowest-terms representation.
5. [5]Knuth, Donald E. The Art of Computer Programming, Volume 2: Seminumerical Algorithms, 3rd edition. Addison-Wesley, 1997. §4.5.2 analyses the Euclidean algorithm's correctness and running time, including Lamé's 1844 worst-case bound.