What's the highest common factor of 12 and 42?
Six. The answer is six.
But if you're here, you probably already knew that — or you're helping a kid with homework, prepping for a test, or just one of those people who likes to understand why the answer is what it is. The short version: 6 is the largest number that divides evenly into both 12 and 42. Fair enough. But there's more to the story, and understanding the how matters way more than memorizing the what*.
What Is the Highest Common Factor
Highest common factor. And gCF. GCD. And same thing, different names. Greatest common divisor. HCF. It's the biggest integer that goes into two (or more) numbers without leaving a remainder.
Think of it like this: you've got 12 apples and 42 oranges. The largest number of groups you can make? Six. Also, you want to divide them into identical groups — same number of apples, same number of oranges in each group — with nothing left over. Each group gets 2 apples and 7 oranges.
Why the terminology matters
In the US, "greatest common factor" or "greatest common divisor" is standard. In the UK and Commonwealth countries, "highest common factor" is the norm. If you're reading a textbook or watching a tutorial from another country, don't get tripped up — they're identical concepts.
Why It Matters / Why People Care
You might wonder: when does anyone actually use this outside of math class?
More often than you'd think.
Simplifying fractions
This is the big one. Looks messy. But divide numerator and denominator by their HCF (6), and you get 2/7. Done. In real terms, clean. You have a fraction like 12/42. Every time you reduce a fraction to lowest terms, you're finding the HCF whether you realize it or not.
Real-world grouping problems
- Cutting two lengths of rope (12m and 42m) into equal pieces with no waste
- Arranging 12 boys and 42 girls into teams with the same boy-girl ratio
- Tiling a 12×42 rectangle with the largest possible square tiles
Algebra and beyond
Factoring polynomials? Practically speaking, the HCF shows up everywhere. Working with modular arithmetic? Finding common denominators? It's one of those foundational concepts that keeps paying dividends.
How to Find the HCF of 12 and 42 (And Any Other Pair)
There are three main methods. Each has its place.
Method 1: List the factors
Old school. Reliable. Gets tedious with big numbers.
Factors of 12: 1, 2, 3, 4, 6, 12
Factors of 42: 1, 2, 3, 6, 7, 14, 21, 42
Common factors: 1, 2, 3, 6
Highest: 6
Works great for small numbers. Day to day, for 12 and 42? Perfect. On the flip side, for 1,236 and 4,872? You'll be there a while.
Method 2: Prime factorization
This is the method that scales. Break each number into its prime building blocks.
12 = 2 × 2 × 3 = 2² × 3
42 = 2 × 3 × 7
Now look for overlap. Practically speaking, both have a 3. Both have a 2. Multiply the shared primes: 2 × 3 = 6.
The rule: take each common prime factor to the lowest* power it appears in either factorization. Now, here, 2 appears as 2² in 12 but only 2¹ in 42, so we take 2¹. Think about it: the 3 appears as 3¹ in both, so we take 3¹. Result: 2 × 3 = 6.
This method shines when:
- Numbers are larger
- You're finding HCF of three or more numbers
- You need to explain why the answer is what it is
Method 3: Euclidean algorithm
The pro move. Fast, elegant, works for massive numbers without prime factorization.
The principle: HCF(a, b) = HCF(b, a mod b). Keep going until the remainder is zero. The last non-zero remainder is your HCF.
Let's trace it for 12 and 42:
1.42 ÷ 12 = 3 remainder 6
→ HCF(42, 12) = HCF(12, 6)
2.12 ÷ 6 = 2 remainder 0
→ HCF(12, 6) = HCF(6, 0) = 6
Done in two steps. Even so, this is how computers do it. This is how you should do it when numbers get big.
Which method should you use?
| Situation | Best Method |
|---|---|
| Small numbers (< 100), mental math | List factors |
| Medium numbers, need to show work | Prime factorization |
| Large numbers, or just want speed | Euclidean algorithm |
| Teaching someone the concept | Start with listing, build to prime factorization |
Common Mistakes / What Most People Get Wrong
Confusing HCF with LCM
This is the big one. Lowest common multiple* is the smallest number both divide into*. Highest common factor* is the largest number that divides both*.
For more on this topic, read our article on how many days is 48 hours or check out how many ounces in 1.5 liters.
For 12 and 42:
- HCF = 6
- LCM = 84
They're related: HCF × LCM = 12 × 42 = 504. But they answer opposite questions.
Forgetting 1 is always a common factor
Every pair of positive integers has at least 1 as a common factor. If you get 1 as your HCF, the numbers are coprime* (relatively prime). That's a valid answer — not a mistake.
Using the wrong power in prime factorization
Saw this constantly when I tutored. Someone writes:
- 12 = 2² × 3
- 18 = 2 × 3²
Then multiplies 2² × 3² = 36. Now, you take the minimum* exponent for each shared prime: 2¹ × 3¹ = 6. Day to day, wrong. The HCF can never be larger than the smaller number.
Stopping too early in Euclidean algorithm
If you stop at the first remainder instead of continuing to zero, you might get lucky — or you might get a common factor that isn't the highest*. Always run it to completion.
Practical Tips / What Actually Works
For mental math: use divisibility rules
Spot that both 12 and 42 are even → divisible by 2.
Sum of digits: 1+2=3, 4+2=6
More mental shortcuts
- Divisible by 4? Look at the last two digits. 12 ends in “12” (12 ÷ 4 = 3) and 42 ends in “42” (42 ÷ 4 = 10.5). Only 12 is divisible by 4, so 4 can’t be part of the HCF.
- Divisible by 5? Both numbers would need to end in 0 or 5. Neither does, so 5 is out.
- Divisible by 7? Quick test: double the last digit, subtract from the rest. For 12 → 1 − 4 = −3 (not a multiple of 7). For 42 → 4 − 14 = −10 (also not). So 7 isn’t a factor.
These quick checks let you trim the candidate list before you even start factoring.
When you have three or more numbers
Prime factorization scales nicely. Suppose you need the HCF of 18, 30, and 42.1.
-
Identify the primes that appear in all three factorizations: 2 and 3.3. Take the lowest exponent for each: 2¹ (minimum of 1,1,1) and 3¹ (minimum of 2,1,1).
-
Multiply: 2 × 3 = 6 → HCF(18, 30, 42) = 6.
The Euclidean algorithm can also handle multiple numbers by iterating:
hcf(a,b,c) = hcf(hcf(a,b), c). This keeps the computation short even with large sets.
A quick “check‑your‑work” trick
If you find an HCF, multiply it by the LCM of the same pair. The product should equal the product of the original numbers.
For 12 and 42:
- HCF = 6
- LCM = 84
- 6 × 84 = 504 = 12 × 42
If the equality fails, something went wrong.
Wrapping it all up
Choosing the right method depends on the size of the numbers and what you’re trying to achieve. For tiny values, listing factors is fastest. Worth adding: when you need to show the reasoning or work with three or more numbers, prime factorization gives a clear, logical path. For anything beyond mental arithmetic—especially when dealing with large or many numbers—the Euclidean algorithm is the pro’s go‑to; it’s efficient, systematic, and the algorithm computers rely on.
Mastering these three approaches equips you to tackle HCF problems with confidence, whether you’re solving a classroom exercise, simplifying a fraction, or debugging a programming routine. Practically speaking, remember the core ideas: common factors are the intersection of prime factor sets, the Euclidean algorithm repeatedly reduces the problem, and always verify that your answer truly divides both numbers. With practice, the right method will become second nature.
