How to Simplify Fractions: The GCD Method Explained

A fraction like 24/36 and a fraction like 2/3 represent exactly the same value, but one is far easier to work with. Simplifying (or "reducing") a fraction means rewriting it with the smallest possible numerator and denominator while keeping its value unchanged — and the reliable way to do that is with the greatest common divisor.

What "simplifying" a fraction actually means

A fraction is in its simplest form when the numerator and denominator share no common factors other than 1. Multiplying or dividing both the top and bottom of a fraction by the same number never changes its value — it just changes what the fraction looks like. Simplifying takes advantage of this by dividing both numbers by the largest number that evenly divides both.

The GCD method, step by step

The greatest common divisor (GCD), also called the greatest common factor, is the largest number that divides evenly into both the numerator and denominator. Once you find it, dividing both parts of the fraction by the GCD gives you the simplest form in a single step:

For 24/36: list the factors of 24 (1, 2, 3, 4, 6, 8, 12, 24) and the factors of 36 (1, 2, 3, 4, 6, 9, 12, 18, 36). The largest number appearing in both lists is 12, so dividing both parts by 12 gives 24÷12 / 36÷12 = 2/3 — already fully simplified, since 2 and 3 share no common factors besides 1.

A short history of fractions

Ancient Egyptians wrote most fractions as sums of unit fractions, such as 1/2 + 1/4, and the Rhind Papyrus from about 1650 BCE contains tables for doing this. Euclid's Elements, written around 300 BCE, includes the algorithm for finding the greatest common divisor that we still use today. The horizontal fraction bar was introduced by Arabic mathematicians, with al-Hassar in the twelfth century often credited with it, and it was popularized in Europe by Fibonacci in his Liber Abaci of 1202. Decimal fractions came later; Simon Stevin's 1585 booklet De Thiende laid out how to use them in everyday calculation.

Euclid's algorithm in action

Prime factorization is fine for small numbers, but for large ones Euclid's method is faster. To find the GCD of 48 and 18, divide the larger by the smaller and keep the remainder: 48 = 2 × 18 + 12, then 18 = 1 × 12 + 6, then 12 = 2 × 6 + 0. The last non-zero remainder, 6, is the GCD. Dividing the numerator and denominator of 48/18 by 6 gives 8/3. The algorithm is over 2,000 years old and is still used in computer science and cryptography.

Mixed numbers and improper fractions

An improper fraction like 8/3 can be written as the mixed number 2 2/3, because 8 ÷ 3 is 2 with a remainder of 2. To go back, multiply the whole number by the denominator and add the numerator: 2 × 3 + 2 = 8, which gives 8/3. Many answers are expected in simplest form as a mixed number, so check which form your teacher or application wants.

Common mistakes to avoid

• Cancelling terms that are added instead of factors. In (2 + 3)/(2 + 5), you cannot cross out the 2s.
• Dividing the top and bottom by different numbers, which changes the value.
• Stopping early. If both numbers are still even, or the digits of both sum to a multiple of 3, you can keep going.
• Forgetting that negative signs belong on the whole fraction, so −3/4 is the same as 3/−4.

Divisibility shortcuts

A number is divisible by 2 if its last digit is even, by 3 if its digits add to a multiple of 3, by 5 if it ends in 0 or 5, and by 9 if its digits add to a multiple of 9. These quick tests help you find common factors in your head. The Fraction Calculator and the LCM and GCF Calculator on this site can check your work and show the steps.

A faster way to find the GCD: the Euclidean algorithm

Listing out every factor works fine for small numbers, but becomes tedious for larger ones. The Euclidean algorithm finds the GCD much faster by repeatedly applying one simple rule: divide the larger number by the smaller number, and replace the larger number with the remainder. Repeat until the remainder is 0 — the last non-zero remainder is the GCD.

For example, finding the GCD of 84 and 126: 126 ÷ 84 leaves a remainder of 42. Then 84 ÷ 42 leaves a remainder of 0. Since the last non-zero remainder was 42, the GCD of 84 and 126 is 42 — and 84/126 simplifies to 2/3.

Adding, subtracting, multiplying, and dividing fractions

Simplification also matters for combining fractions. Multiplying fractions is direct — multiply numerators together and denominators together, then simplify the result:

Adding or subtracting fractions requires a common denominator first — typically the least common multiple of the two denominators — before the numerators can be combined. Dividing fractions is multiplication by the reciprocal: flip the second fraction, then multiply. In every case, simplifying the final result (using the GCD method above) keeps the answer in its cleanest, most usable form.