01 — Explanation
How do I break a number down into its prime factors?
Use a factor tree: split the number into any two factors, circle any that are already prime, and keep splitting the non-prime ones until every branch ends in a circled prime. Multiply all the circled primes together (writing repeated factors using powers) to get the prime factor decomposition.
Example — decompose 525: . Collecting the circled primes: .
Exam Tip
Always finish in index form (), not the expanded list () — the index form is what the next two skills (HCF and LCM) actually need.
02 — Explanation
How do I find the Highest Common Factor (HCF)?
Write both numbers in prime-factor index form, then multiply together only the primes common to both, each raised to the lowest power it appears with.
Example — HCF of 72 and 90: , . Both share and . Lowest power of is ; lowest power of is . .
The "lowest power" rule feels backwards at first, but it's logical: a common factor has to divide into both original numbers, so it can't contain more of a prime than the number with the least of it.
03 — Explanation
How do I find the Lowest Common Multiple (LCM)?
Take every distinct prime appearing in either number, each raised to the highest power it appears with anywhere, and multiply them together.
Example — LCM of 72 and 90: distinct primes are . Highest powers: , , . .
Exam Tip
Students often swap the two rules — "highest for HCF, lowest for LCM" — because of the words "Highest" and "Lowest" in the names. It's the opposite: the multiple must be big enough to contain everything (highest power), while the factor must be small enough to fit inside everything (lowest power).
A useful self-check: (first number) (second number). For 72 and 90: . ✓
04 — Explanation
How do I know whether a word problem needs HCF or LCM?
| Clue in the question | What's needed |
|---|---|
| "Largest number of identical groups", "greatest number that divides into" | HCF |
| "When will they next coincide", "happen at the same time again" | LCM |
Example: two buses leave every 24 and 40 minutes. When do they next leave together? This is a coincidence/timing question, so it's LCM. , . minutes — i.e. 2 hours later.
05 — Explanation
How do I secure method marks on these questions?
Showing at least two steps of a factor tree, or writing both numbers in index form before selecting the common/distinct primes, is enough to secure the method mark even if your final arithmetic slips. A final answer with no PFD working risks losing marks entirely if it's wrong.
06 — Worked example
Worked example
Find the LCM of where and where .
- .
- .
- Take the highest power of each prime present anywhere: .
- .
Treat the algebraic manipulation (, ) as a first step, then apply the ordinary LCM rule exactly as before.