What's the greatest common factor of 15 and 20?
Five. The answer is five.
But if you're here, you probably already knew that — or you could've guessed it in two seconds. Think about it: the real question isn't what* the answer is. It's why it works, how to find it when the numbers aren't so friendly, and where* this actually shows up in real life.
Because greatest common factor (GCF) — also called greatest common divisor (GCD) or highest common factor (HCF) depending on where you learned math — is one of those concepts that seems trivial until you need it. Then suddenly you're simplifying fractions, factoring polynomials, cutting fabric into equal strips, or figuring out how many identical gift bags you can make from two different candy counts.
Let's walk through it properly. That's why no fluff. Just the stuff that actually matters.
What Is Greatest Common Factor
The greatest common factor of two (or more) numbers is exactly what it sounds like: the largest number that divides evenly into all of them. But no remainders. No decimals. Clean division.
For 15 and 20:
- Factors of 15: 1, 3, 5, 15
- Factors of 20: 1, 2, 4, 5, 10, 20
- Common factors: 1, 5
- Greatest: 5
That's it. But the definition only gets you so far. What matters is recognizing that every pair of integers has a GCF* — even if it's just 1. When the GCF is 1, the numbers are called relatively prime* or coprime*. That distinction shows up more often than you'd think.
GCF vs. LCM — Don't Mix Them Up
This is the most common confusion. In real terms, gCF is the largest* number that divides into* your numbers. Least common multiple (LCM) is the smallest* number that your numbers divide into*.
- GCF of 15 and 20 = 5
- LCM of 15 and 20 = 60
They're related — there's even a formula connecting them — but they answer completely different questions. GCF is about shrinking* (simplifying, grouping, factoring out). LCM is about expanding* (finding common denominators, syncing cycles, scaling up).
Why It Matters / Why People Care
You might be thinking: "Okay, but when do I actually use this?"
More often than you realize.
Simplifying Fractions — The Classic Use Case
This is where most people first meet GCF. You have a fraction like 15/20. You want to reduce it. You could* divide by 5 because you spot it. But what about 144/216? Or 3,465/5,775?
Finding the GCF lets you reduce in one step instead of chipping away. One division: 144/216 = 2/3. 144 and 216 have a GCF of 72. Done.
Factoring Algebraic Expressions
GCF doesn't stop at arithmetic. In algebra, you factor out the GCF of terms* — not just numbers, but variables too.
6x² + 9x → GCF is 3x → 3x(2x + 3)
12a³b² + 18a²b⁴ → GCF is 6a²b² → 6a²b²(2a + 3b²)
This is the first step in almost every factoring problem. Skip it, and you're making life harder.
Real-World Grouping Problems
- You have 15 apples and 20 oranges. You want identical fruit baskets with no leftovers. How many baskets? 5 (each gets 3 apples, 4 oranges).
- Two gears have 15 and 20 teeth. How many rotations until they realign? That's LCM territory — but the GCF tells you the fundamental "step size" of their interaction.
- Cutting two boards (15 inches and 20 inches) into equal-length pieces with no waste? Longest possible piece: 5 inches.
These aren't textbook inventions. They're manufacturing, logistics, construction, coding — anywhere discrete quantities need to be partitioned evenly.
How to Find the GCF — Methods That Actually Work
There isn't just one way. The "best" method depends on the numbers, the context, and honestly, what you're comfortable with. Here are the four main approaches.
1. List the Factors (Brute Force)
Write out all factors of each number. Circle the common ones. Pick the biggest.
Best for: Small numbers (under 100), mental math, teaching beginners.
Example: GCF of 18 and 24
- 18: 1, 2, 3, 6, 9, 18
- 24: 1, 2, 3, 4, 6, 8, 12, 24
- Common: 1, 2, 3, 6 → GCF = 6
Downside: Gets painful fast. Try listing factors of 1,232. I'll wait.
2. Prime Factorization — The Structural Approach
Break each number into its prime building blocks. Multiply the shared* primes (using the lowest exponent for each).
If you found this helpful, you might also enjoy 46 c is what in fahrenheit or how many cups in 3 liters.
Best for: Medium numbers, understanding why the GCF is what it is, algebraic expressions.
Example: GCF of 15 and 20
- 15 = 3 × 5
- 20 = 2² × 5
- Shared: 5 → GCF = 5
Example with exponents: GCF of 72 and 108
- 72 = 2³ × 3²
- 108 = 2² × 3³
- Shared: 2² × 3² = 4 × 9 = 36
Why this matters: It scales. Variables work the same way.
- 12x³y² = 2² × 3 × x³ × y²
- 18x²y⁴ = 2 × 3² × x² × y⁴
- GCF = 2 × 3 × x² × y² = 6x²y²
3. Euclidean Algorithm — The Pro Move
This is the oldest algorithm still in common use (Euclid, ~300 BC). It's fast, requires no factoring, and works on any integers — even massive ones.
The rule: GCF(a, b) = GCF(b, a mod b) — repeat until remainder is 0. The last non-zero remainder is your GCF.
Example: GCF of 15 and 20
- 20 ÷ 15 = 1 remainder 5
- 15 ÷ 5 = 3 remainder 0
- Last non-zero remainder: 5
Example with bigger numbers: GCF of 1,232 and 896
- 1232 ÷ 896 = 1 remainder 336
- 896 ÷ 336 = 2 remainder 224
- 336 ÷ 224 = 1 remainder 112
- 224 ÷ 11
… remainder 112
- 224 ÷ 112 = 2 remainder 0
The last non‑zero remainder is 112, so GCF(1,232, 896) = 112.
Why the Euclidean Algorithm Shines
- Speed: Each step reduces the size of the numbers dramatically; even numbers with dozens of digits are handled in a handful of iterations.
- No factoring needed: You never have to hunt for primes, which becomes impractical beyond a few thousand.
- Universality: Works for negative integers (just take absolute values) and forms the basis for computing modular inverses in cryptography.
Choosing the Right Method in Practice
| Situation | Preferred Method | Reason |
|---|---|---|
| Numbers < 50 or teaching the concept | Listing factors | Immediate visual of common divisors |
| Need to see the “building‑block” structure (e.g., simplifying fractions, algebraic expressions) | Prime factorization | Reveals shared prime powers and extends naturally to variables |
| Large integers, programming, or when speed matters | Euclidean algorithm | Minimal operations, works for arbitrarily large inputs |
| You already have the GCF and need the LCM | Use the relation LCM(a,b) = | a·b |
Quick Tips to Avoid Common Pitfalls
- Watch for zeros: GCF(0, n) = |n| (any number divides zero). If both are zero, the GCF is undefined.
- Keep signs consistent: The algorithm works on absolute values; re‑apply the original sign only if the context demands a signed divisor (rare in pure GCF problems).
- Don’t confuse GCF with LCM: Remember that GCF ≤ min(a,b) while LCM ≥ max(a,b). If your answer seems too large, you’ve probably slipped into LCM territory.
- Factor out obvious common factors first: If both numbers are even, pull out a 2; if both end in 0 or 5, pull out a 5. This reduces the workload for any method.
A Mini‑Challenge
Try these without a calculator:
- GCF of 231 and 385
- GCF of 1,024 and 768
- GCF of 48x⁵y³ and 80x³y⁷
(Answers: 77, 256, 16x³y³)
Conclusion
The greatest common factor may seem like a modest arithmetic tool, but its influence ripples through fields as diverse as engineering design, cryptography, and everyday problem‑solving. That's why whether you opt for the intuitive factor list, the insightful prime‑factor breakdown, or the lightning‑fast Euclidean algorithm, mastering GCF equips you to break down complex quantities into their simplest, shared building blocks—turning what could be a tangled mess into a clean, repeatable pattern. So the next time you’re faced with two numbers that need to be split evenly, remember: a quick GCF check is often the smartest first step.
