Reduce a Fraction
Simplify fractions using the greatest common divisor
Fraction Simplifier
What is calculated?
This tool reduces a fraction to its simplest form. The greatest common divisor (gcd) of numerator and denominator is computed and both are divided by it. Optionally include a whole number part.
Fraction Reduction Info
Properties
Reduction rules:
Note: A fraction is fully reduced when numerator and denominator are coprime (gcd = 1).
Examples
Formulas & Rules for Fraction Reduction
Principle
Greatest common divisor
Fully reduced
Value preservation
Mixed numbers
Euclidean algorithm
Negative fractions
Prime factorization
Step-by-step Example
Example: Reduce 12/15
Step 1: Find gcd of 12 and 15
Divisors of 15: 1, 3, 5, 15
Common divisors: 1, 3
\[\text{gcd}(12, 15) = 3\]
The greatest common divisor is 3.
Step 2: Divide numerator and denominator by gcd
Step 3: Verify
Step 4: Result
More examples
\[\frac{6}{8} = \frac{3}{4}\] (gcd = 2)
\[\frac{24}{36} = \frac{2}{3}\] (gcd = 12)
\[\frac{7}{11} = \frac{7}{11}\] (gcd = 1)
Euclidean algorithm
15 = 1 × 12 + 3
12 = 4 × 3 + 0
→ gcd = 3
Negative mixed number
The sign applies to the entire value.
Reduction steps
The greatest common divisor determines how much the fraction can be reduced.
Applications of fraction reduction
Reduction is important in many mathematical and practical areas:
Simplifying calculations
- Simpler numbers for computation
- Lower chance of mistakes
- Faster mental arithmetic
- Clearer representation
Ratios & proportions
- Mixing ratios
- Recipe proportions
- Scalings
- Probabilities
Mathematical education
- Understand equivalence
- Number theory basics
- Algorithmic understanding
- Foundations of fraction arithmetic
Technical applications
- Gear ratios
- Frequency ratios
- Material mixtures
- CAD constructions
Mathematical context
Description
Fraction reduction is a fundamental concept in number theory and algebra. It relies on the greatest common divisor and the idea of equivalence of rational numbers. Reducing fractions yields simpler yet equivalent representations. The Euclidean algorithm for computing the gcd is one of the oldest known algorithms and demonstrates the elegant link between practical computation and theoretical mathematics.
Summary
Fraction reduction is more than an arithmetic rule — it's a tool for simplification and deeper insight into the structure of rational numbers. It teaches divisibility, primes and equivalence classes. From practical applications in craft and engineering to abstract mathematical theories, fraction reduction highlights the beauty and utility of mathematical thinking.
More Fraction Calculators
Add Fractions • Compare Fractions • Decimal to Fraction • Divide Fractions • Fraction to Decimal • Fraction to Percent • Egyptian Fraction • Mixed number to improper Fraction • Multiply Fractions • Percent to Fraction • Simplify Fraction • Subtract Fractions •