Fraction Simplifier Calculator

Simplify any fraction to its lowest terms with full working. Enter a numerator and denominator, and the calculator finds the greatest common divisor (GCD) using the Euclidean algorithm, divides both numerator and denominator by the GCD, and shows the result, plus the mixed number form and decimal equivalent.

What is Simplifying a Fraction?

Simplifying (or reducing) a fraction means dividing both the numerator and denominator by their greatest common divisor so that the two numbers share no common factors other than 1. The mathematical value of the fraction remains exactly the same, you are just expressing it in a cleaner, more compact form using smaller numbers.

For example, 18/24 simplifies to 3/4. Both 18 and 24 are divisible by 6, and 6 is the largest number that divides both evenly (the GCD). Dividing numerator and denominator by 6 gives 3/4, which is equivalent to 18/24 but expressed with the smallest possible integers. A fraction in this form is said to be in "lowest terms" or "simplest form".

How It Works, The Euclidean Algorithm

The calculator uses Euclid's algorithm to find the GCD. This algorithm, discovered around 300 BC and recorded in Euclid's Elements (Book VII, Proposition 2), is one of the oldest algorithms still in widespread use. It works by repeated division:

1. Take the two numbers, the numerator and denominator (ignoring any negative signs for the GCD calculation, since GCD is always positive)
2. Divide the larger number by the smaller and keep the remainder
3. Replace the larger number with the smaller, and the smaller with the remainder
4. Repeat steps 2 to 3 until the remainder is 0, the last non-zero remainder is the GCD

Once the GCD is found, divide both the numerator and denominator by it to get the simplified fraction. If the GCD is 1, the fraction is already in its simplest form and no reduction is possible.

Full worked example for 18 and 24:

• Step 1: 24 ÷ 18 = 1 with remainder 6. Now compare 18 and 6.
• Step 2: 18 ÷ 6 = 3 with remainder 0. The GCD is 6.
• Simplify: 18 ÷ 6 = 3, 24 ÷ 6 = 4. Result: 3/4.

The Euclidean algorithm is remarkably efficient. Finding the GCD of two 100-digit numbers takes mere microseconds on modern hardware. This efficiency is why the algorithm is still used today, over two millennia after its discovery, in everything from fraction calculators to cryptographic key generation.

Worked Examples

Example 1: Standard Reduction

Simplify the fraction 45/60.

Apply the Euclidean algorithm to find GCD(45, 60):

• 60 ÷ 45 = 1 remainder 15
• 45 ÷ 15 = 3 remainder 0
• GCD = 15

Then divide: 45 ÷ 15 = 3, 60 ÷ 15 = 4. The simplified fraction is 3/4. As a decimal, 3/4 = 0.75. Since 3 < 4, this is a proper fraction, no mixed number needed.

Example 2: Already in Lowest Terms

Simplify the fraction 17/23.

Both 17 and 23 are prime numbers and different from each other, so the GCD is 1. The fraction 17/23 is already in its lowest terms. No simplification is possible. The calculator reports the same fraction back.

Example 3: Improper Fraction to Mixed Number

Simplify the fraction 28/8.

Apply the Euclidean algorithm:

• 28 ÷ 8 = 3 remainder 4
• 8 ÷ 4 = 2 remainder 0
• GCD = 4

Simplify: 28 ÷ 4 = 7, 8 ÷ 4 = 2. The simplified improper fraction is 7/2.

Convert to a mixed number: 7 ÷ 2 = 3 with remainder 1, so the mixed number is 3 1/2 (three and a half). As a decimal: 3.5.

Example 4: Negative Fractions

Simplify −36/48.

Take absolute values for the GCD: GCD(36, 48) = 12. Divide: 36 ÷ 12 = 3, 48 ÷ 12 = 4. By convention, the negative sign stays with the numerator, so the simplified result is −3/4. If both numerator and denominator were negative, the fraction would be positive after simplification (since a negative divided by a negative is positive).

GCD Properties at a Glance

Frequently Asked Questions

What does "lowest terms" or "simplest form" mean? A fraction is in lowest terms when no integer greater than 1 divides both the numerator and denominator evenly. Equivalently, the GCD of the numerator and denominator is exactly 1. The fraction 2/4 is not in lowest terms because both 2 and 4 share a factor of 2; simplifying gives 1/2, which is in lowest terms.

Does simplifying change the value of the fraction? No. The fractions 6/8 and 3/4 represent exactly the same number, 0.75. Simplifying is purely a cosmetic convenience, expressing the same value using smaller numbers. Mathematically, 6/8 = 3/4 because 6 × 4 = 3 × 8 = 24.

What happens if the numerator is zero? Zero divided by any non-zero denominator is zero. The simplified form is 0/1 because any non-zero number divides zero, but the convention is to write zero as 0/1. If the denominator is also zero (0/0), the fraction is undefined, it is an indeterminate form with no meaningful numeric value.

Can a fraction's GCD be a decimal or fraction? No. By definition, the greatest common divisor of two integers is always an integer. The GCD is the largest integer that divides both numbers without a remainder. Fractions with decimal numerators or denominators are typically converted to integer form before simplification by multiplying both by a power of 10.

What if both the numerator and denominator are negative? A fraction with two negative signs is positive because a negative divided by a negative equals a positive: −a/−b = a/b. The calculator automatically normalises negative fractions so that only the numerator carries the sign, and if both are negative, the sign cancels out entirely.

Why use the Euclidean algorithm instead of prime factorisation to find the GCD? The Euclidean algorithm is dramatically faster for large numbers. Finding the GCD of two 100-digit numbers using Euclid's method takes microseconds. Factorising a 100-digit number into its prime factors, by contrast, is computationally infeasible, this difficulty is the entire basis of RSA encryption, which secures most of the internet. The Euclidean algorithm scales linearly with the number of digits, while prime factorisation scales exponentially.

What is a mixed number and when should I use one? A mixed number expresses an improper fraction (where the numerator is greater than or equal to the denominator) as a whole number plus a proper fraction. For example, 7/2 becomes 3 1/2. Mixed numbers are often easier to interpret in everyday contexts, "three and a half" feels more natural than "seven halves" when describing a quantity. In formal mathematics, improper fractions are generally preferred because they are easier to manipulate algebraically.

Can every fraction be simplified to an integer? Only fractions where the numerator is an exact multiple of the denominator simplify to an integer. For example, 12/4 = 3 (an integer), but 13/4 stays as 13/4 because 13 and 4 are coprime. The simplified form of 13/4 as a mixed number is 3 1/4. Most fractions do not simplify to integers, they remain as proper or improper fractions even after reduction.

Related Tools

• Fraction Calculator
• Ratio Calculator
• LCM & GCD Calculator
• Prime Factorisation Calculator

Inputs and Their Effects

The fraction simplifier takes exactly two integer inputs: a numerator and a denominator. Negative values are accepted and normalised so that only the numerator carries the sign, a fraction with both inputs negative is treated as positive because the negatives cancel. Zero is a valid numerator but never a valid denominator; attempting 0/0 returns an undefined-fraction error. Very large integers (hundreds of digits) are handled without overflow because the Euclidean algorithm only ever divides and takes remainders, never multiplies the inputs together. If you enter a decimal value, the calculator multiplies both numbers by a power of ten to convert them to integers before simplifying, which keeps the algorithm in its native integer domain.

Common Mistakes to Avoid

The most frequent error is assuming that simplifying changes the value of the fraction, it does not. 6/8 and 3/4 are exactly the same number. Another common pitfall is forgetting to handle the negative case. −6/8 simplifies to −3/4, not 3/4. Forgetting the sign is a frequent cause of "wrong answer" reports when the algorithm is implemented manually. A third mistake is trying to simplify decimal fractions directly: 0.5/1.5 is the same as 1/3, but the algorithm requires integers. Convert decimals to fractions first, then simplify. Finally, do not confuse "lowest terms" with "smallest numbers", the lowest-terms definition is formal (GCD = 1), not visual.

When to Use This Tool

Use the simplifier whenever you have a fraction that you suspect can be reduced, for example, after a calculation that produced large numerators and denominators, or when checking student work in a classroom setting. The tool is also useful for verifying that you found the GCD correctly when learning the Euclidean algorithm by hand. In programming contexts, the simplifier is a quick sanity check on fraction-arithmetic libraries. It is not appropriate for symbolic fractions (with variables in the numerator or denominator), those require algebraic manipulation, not the Euclidean algorithm.

How the Math Works

The Euclidean algorithm traces back to Euclid's Elements around 300 BC. It works because the GCD of two numbers is also the GCD of either number and their difference. Repeatedly replacing the larger number with the remainder of dividing it by the smaller number converges in O(log(min(a, b))) steps to the GCD. Once the GCD is found, both the numerator and denominator are divided by it, yielding the simplest equivalent fraction. The proof of correctness is constructive: every step preserves the GCD, so the final non-zero remainder is exactly the GCD. There is no faster general algorithm for two integers, although special cases (powers of two, twin primes) admit constant-time shortcuts.

Practical Tips

When entering large numbers, use the keyboard rather than the spinner controls, it is faster and avoids accidental off-by-one errors. If the result includes a mixed number you do not need, switch the output toggle to "improper fraction" only. For classroom use, set the calculator to show the step-by-step GCD computation alongside the result, so students can follow the algorithm. When verifying manual calculations, enter the original numerator and denominator and check that the GCD matches what you computed by hand. If you see a fraction like 100/200, expect the simplifier to return 1/2, that is the "obvious" simplification that beginners sometimes miss.

Worked Examples

A typical Fraction Simplifier Calculator run takes reasonable inputs, produces a sensible answer, and returns it in a single click. Example: Simplify the fraction 45/60. Apply the Euclidean algorithm to find GCD(45, 60): - 60 ÷ 45 = 1 remainder 15 - 45 ÷ 15 = 3 remainder 0 - GCD = 15 Then divide: 45 ÷ 15 = 3, 60 ÷ 15 = 4. The simplified fraction is 3/4. As a decimal, 3/4 = 0.75. Since 3 < 4, this is a proper fraction, no mixed number needed.

References

• Euclid's algorithm for the greatest common divisor, the method this calculator uses to reduce fractions. https://en.wikipedia.org/wiki/Euclidean_algorithm
• NIST Digital Library of Mathematical Functions, for the arithmetic of rational numbers. https://dlmf.nist.gov/