Skip to content

Simplify Calculator — Fractions Step by Step

Enter a fraction's numerator and denominator to simplify it to lowest terms. The calculator shows the GCD, the simplified fraction, its decimal equivalent, and a step-by-step explanation.

Top number of the fraction

Bottom number of the fraction (cannot be zero)

Simplified Fraction
2/3
GCD (Greatest Common Divisor)
12
Decimal Equivalent
0.67
Mixed Number
N/A
Already Simplified?
No
Step-by-Step
24/36 → GCD = 12 → (24 ÷ 12) / (36 ÷ 12) = 2/3 → 2/3 = 0.666667
Original FractionSimplifiedGCDDecimal
1/36 1/36 1 0.03
2/36 1/18 2 0.06
3/36 1/12 3 0.08
4/36 1/9 4 0.11
5/36 5/36 1 0.14
6/36 1/6 6 0.17
7/36 7/36 1 0.19
8/36 2/9 4 0.22
9/36 1/4 9 0.25
10/36 5/18 2 0.28
11/36 11/36 1 0.31
12/36 1/3 12 0.33

كيف يعمل

المعادلة الرياضية

GCD(a, b) found using Euclidean algorithm: repeat: a, b = b, a mod b until b = 0 Simplified fraction: (numerator ÷ GCD) / (denominator ÷ GCD)

مثال توضيحي

Simplify 24/36: 1. GCD(24, 36): 36 mod 24=12; 24 mod 12=0 → GCD = 12 2. 24 ÷ 12 = 2; 36 ÷ 12 = 3 3. Simplified: 2/3 4. Decimal: 2 ÷ 3 = 0.6667

What Is a Simplified Fraction?

A fraction is in its simplest form (lowest terms) when the only positive integer that divides both the numerator and the denominator is 1. In other words, they share no common factors greater than 1.

  • 24/36 → not simplified (GCD = 12) → simplifies to 2/3
  • 7/9 → already simplified (GCD = 1)
  • 100/200 → GCD = 100 → simplifies to 1/2

The GCD Method (Standard Approach)

The Greatest Common Divisor is found using the Euclidean algorithm, one of the oldest known algorithms (circa 300 BC):

GCD(a, b):
  while b ≠ 0:
    a, b = b, a mod b
  return a

For GCD(36, 24):

Stepaba mod b
1362412
224120
DoneGCD = 12

Then: 36/24 = (36÷12)/(24÷12) = 3/2

When the Result Is a Mixed Number

If |numerator| ≥ denominator, the fraction is “improper” and can be expressed as a mixed number:

  • 7/3: whole part = floor(7/3) = 2, remainder = 7 − 2×3 = 1 → 2 and 1/3
  • 9/4 = 2 and 1/4
  • Mixed numbers are common in cooking (2½ cups) and construction (3¾ inches)

Common Mistakes When Simplifying

  1. Dividing by a common factor but not the GCD: 8/12 → some students simplify by 2 to get 4/6, then by 2 again to get 2/3. This works, but finding the GCD first is more efficient.
  2. Changing the fraction’s value: Simplification does NOT change the value — 24/36 and 2/3 represent exactly the same part of a whole.
  3. Applying simplification to mixed-operation expressions: You can only cancel common factors that appear in both numerator and denominator, not terms that are added or subtracted. (x+3)/(x+3) simplifies to 1, but (x+3)/x does not simplify further.

Decimal and Percentage Equivalents

Once simplified, the decimal form is straightforward: divide the numerator by the denominator. Multiply by 100 for the percentage:

FractionSimplifiedDecimalPercent
2/41/20.550%
6/92/30.6̄66.67%
15/203/40.7575%
12/163/40.7575%

Why Simplification Matters

  • Test scores: Unsimplified answers are typically marked wrong in school exams.
  • Cooking and recipes: 8/16 cups is confusing; 1/2 cup is clear.
  • Engineering ratios: Gear ratios and mix ratios are always expressed in lowest terms (1:3, not 2:6).
  • Probability: A probability of 12/48 is immediately read as 1/4 (25%) when simplified.

الأسئلة الشائعة

What does 'simplify a fraction' mean?

Simplifying (or reducing) a fraction means dividing both the numerator and denominator by their Greatest Common Divisor (GCD) until no whole number greater than 1 divides both evenly. The result is the fraction in 'lowest terms'.

How do I simplify 12/18?

GCD(12, 18) = 6. Divide both: 12÷6 = 2, 18÷6 = 3. So 12/18 simplifies to 2/3.

Can a fraction be further simplified if GCD = 1?

No. If GCD(numerator, denominator) = 1, the fraction is already in its simplest (irreducible) form. For example, 7/9 cannot be simplified because GCD(7,9) = 1.

What is a mixed number?

A mixed number combines a whole number and a proper fraction. For example, 7/3 = 2 and 1/3, written as 2⅓. It applies when |numerator| ≥ denominator.

How does the Euclidean algorithm find the GCD?

The Euclidean algorithm repeatedly replaces (a, b) with (b, a mod b) until b = 0. The last non-zero remainder is the GCD. Example for GCD(48, 18): 48 mod 18=12; 18 mod 12=6; 12 mod 6=0 → GCD = 6.

Can I use this calculator for algebraic expressions?

This tool simplifies numerical fractions using GCD. For algebraic expressions like (x²−1)/(x−1), you need a symbolic algebra simplifier (e.g., WolframAlpha or Symbolab). Our tool focuses on the numeric fraction case, which covers most real-world and exam needs.

آخر تحديث: 1 سبتمبر 2026