How to Simplify Fractions to Lowest Terms
The Euclidean algorithm method for fraction reduction:
STEP 01
Find Factors
Find all factors of the numerator and denominator.
STEP 02
Identify GCD
Find the highest common number that divides evenly into both.
STEP 03
Divide Both
Divide both top and bottom by the GCD.
STEP 04
Irreducible Form
The resulting fraction has GCD = 1 and cannot be reduced further.