Welcome! Today we're learning HCF from Prime Factorisations: The Lowest-Power Rule — a clean, systematic method that replaces guesswork with logic.
You've learned to factorise numbers into their unique prime fingerprints.
Now we put that fingerprint to work.
Finding the Highest Common Factor used to mean trial and error — but with prime factorisations in hand, it becomes a simple comparison:
By the end of this section, you'll be able to:
| Goal | What you'll do |
|---|---|
| Compute | Find HCF from any pair of factorisations |
| Understand | Know WHY the lowest-power rule works |
| Verify | Use a sanity check that catches the most common swap error |
Finding HCF from Prime Factorisations 🔍
You've learned to factorise numbers into their unique prime fingerprints. Now we put that fingerprint to work!
Before you can apply any power rule to find the HCF, you need to see which primes the two numbers actually share.
This is the first step — and missing a prime or including a non-shared one changes the answer completely.
Let's look at two numbers and their prime factorisations:
Primes appearing in 504:
Primes appearing in 990:
Your turn 🤔
Which primes are common to both 504 and 990?
Which primes appear in only one of them?
Explain why the non-common primes cannot be part of the HCF.
To find common primes, look at both factorisations side by side:
Primes in 504: 2, 3, 7
Primes in 990: 2, 3, 5, 11
Common to both: 2 and 3common — these appear in BOTH lists.
Only in 504: 7
Only in 990: 5 and 11
The HCF can only include primes that divide BOTH numbers. A prime that appears in only one factorisation cannot be part of any common factor — because it simply doesn't divide the other number!
Why can't the HCF include 7?
Because HCF must divide both numbers. If HCF contained a factor of 7, then HCF would need to divide 990.
But — there's no 7no 7! in its factorisation.
A number without 7 in its prime factorisation is not divisible by 7 (by FTA uniqueness). So including 7 in the HCF would make it fail to divide 990.
Same logic for 5 and 11 — they're not in 504's factorisation, so they can't be in any number that divides 504.
Key insight: Only primes that appear in both factorisations can be part of the HCF.
The Rule for Finding HCF from Prime Factorisations:
HCF includes only primes that appear in ALL the given factorisations.
Why does this rule work?
The HCF must divide both numbers exactly. If a prime appears in only one factorisation, it cannot divide the other number — so it cannot be part of the HCF.
For 504 and 990:
You know which primes to include in the HCF — the ones that appear in both factorisations.
Now you need to decide how many of each — and the answer is always the smaller power.
Understanding why is what prevents the swap error that costs full marks.
Here's the situation:
Both numbers have the prime 2, but with different powers.
The HCF needs to include some power of 2.
Should the HCF include or ?
Explain your choice by considering what happens if you pick the wrong one.
Think about what HCF means: the LARGEST number that divides BOTH given numbers. The key constraint is 'divides both'.
504 has in its factorisation. So 504 is divisible by 8.
990 has in its factorisation. So 990 is divisible by 2, but NOT by 4 or 8.
If the HCF included , it would need to divide 990. But — not exact. So 8 does not divide 990fails, and any number containing a factor of 8 cannot divide 990 either.
The largest power of 2 that divides BOTH numbers is . That's the bottleneck — 990 limits how many 2s the HCF can have.
This is why the rule is: take the MINIMUM power of each common prime. The number with fewer copies of that prime sets the limit.
If one number has and the other has , the HCF can only use winner — because the first number won't be divisible by anything with more than two 3s.
You understand which primes to include and why you take the lowest power.
Now let's put it all together and compute a complete HCF, with the sanity check that catches errors.
Here's what we're working with:
Your Task 📝
Compute .
Show:
Let's go through it methodically.
Step 1 — List the factorisations side by side:
Step 2 — Find common primes: 2 and 3 appear in both. The primes 5, 7, 11 each appear in only one — exclude them.
Step 3 — Take the minimum power of each common prime:
See how we always pick the smaller power? That's the key.
Step 4 — Multiply: HCF .
Step 5 — Sanity check: HCF must be the smallest given number. Smallest is 504. Is ? Yes. ✓
If your HCF had come out larger than 504, you'd know something went wrong — probably swapped the min/max rule.
Step 6 — Verify (optional but recommended): (exact). (exact). Both divide cleanly. HCF confirmed. ✓
You can handle two numbers confidently. With three numbers, the procedure is identical — but there's one extra thing to watch:
A prime that's common to two of the three numbers but missing from the third gets excluded entirely.
Here are the three numbers and their prime factorisations:
Compute HCF(180, 252, 600).
Be careful about which primes are common to ALL three numbers.
State your answer and verify it divides each of the three numbers.
The procedure for three numbers is the same as for two — just check ALL three factorisations.
Our three numbers and their prime factorisations:
Common primes — a prime must appear in ALL THREE factorisations:
Take the minimum power across ALL THREE for each common prime:
HCF =
Sanity check: (the smallest number). Good.
Verify: , , . All exact. ✅confirmed
⚠️ The common trap with three numbers: including a prime that appears in two of the three (like 5 here).
It must appear in ALL of them, or it's out.
| Prime | In 180? | In 252? | In 600? | Common to ALL? |
|---|---|---|---|---|
| 2 | ✓ | ✓ | ✓ | ✅ Yes |
| 3 | ✓ | ✓ | ✓ | ✅ Yes |
| 5 | ✓ | ✗missing! | ✓ | ❌ No |
| 7 | ✗ | ✓ | ✗ | ❌ No |