Variable Key
a/b= fraction to simplifyGCD= greatest common divisor
Simplify a fraction
Divide both by their greatest common divisor.
Finding the GCD (Euclidean Algorithm)
Repeatedly divide until remainder is 0.
Step 1
Stop when
a/b= fraction to simplify
GCD= greatest common divisor
Simplifying a fraction (reducing to lowest terms) means dividing both the numerator and denominator by their Greatest Common Factor (GCF). The result is an equivalent fraction with the smallest possible whole numbers.
💡
Pro Tip
Quick check: if both numbers are even, divide both by 2. Keep doing this until at least one is odd. Then check for other common factors.
⭐
Did You Know?
Euclid's algorithm for finding the GCF (and thus simplifying fractions) is one of the oldest algorithms still in use — it appears in Euclid's Elements written around 300 BC.
🔒
100% Miễn phí
Không cần đăng ký
✓
Chính xác
Công thức đã xác minh
⚡
Tức thì
Kết quả khi nhập
📱
Sẵn sàng di động
Mọi thiết bị