Prime Factorisation, HCF and LCM

Learn to break numbers into prime factors, then use those factors to find the highest common factor and lowest common multiple. Small examples come first, followed by GCSE problems.

Foundation-first, for both tiers. The final worked example and practice question extend the same methods to three numbers.

Start with prime building blocks

A prime number has exactly two positive factors: 1 and itself. Prime factorisation writes a whole number greater than 1 as a multiplication of primes.

For example, 12 can be built from 2 × 2 × 3. These prime building blocks help us find shared factors and shared multiples.

We will start with small numbers, then use the same idea for HCF and LCM. All numbers in the methods below are positive whole numbers.

Example Question:

Two lights flash every 8 seconds and every 12 seconds. They flash together now. When will they next coincide?

We need a shared multiple, not a shared factor. Example 10 shows how to find the first one.

Exam Tip

Read whether the question wants a product of primes, an HCF or an LCM.

After choosing the prime powers for an HCF or LCM, multiply them to give the numerical answer.

HCF or LCM?

HCFLCM
Greatest shared factorSmallest shared positive multiple
Must divide every original numberMust be divisible by every original number
No larger than the smallest original numberAt least as large as the largest original number
Equal grouping or longest equal pieces, with nothing left overNext time repeating events coincide

Decide what the answer must do. Do not choose a method from the word “greatest” or “smallest” alone.

Check your answer

Prime factorisation: multiply the prime factors back and check that every final factor is prime.

HCF: divide every original number by your answer. Each result must be a whole number. Check you included all shared copies.

LCM: divide your answer by every original number. Each result must be a whole number. Check you included only the copies needed.

These division checks confirm a shared factor or multiple. The prime-copy selection is what makes it the highest or lowest.

Contexts: answer in packs, pieces, centimetres, seconds or minutes as the question requires.

Frequently Asked Questions

Must a factor tree begin with the smallest prime?

No. Any valid factor pair with both factors greater than 1 will work. Continue until all ends are prime.

Why do I circle prime ends?

It marks branches that are finished. Collect only these ends, including every repeated copy.

Can different trees give different prime factors?

For the same number, fully completed valid trees give the same primes with the same number of copies. Their order may differ.

What if there are no shared prime factors?

The HCF is 1. For LCM, still include every prime power needed by either number.

Why is the LCM not zero?

LCM is defined as the lowest positive common multiple. Zero is not positive.

Can these methods work for three numbers?

Yes. HCF keeps copies shared by all three. LCM includes enough copies to build each of the three numbers.

Scroll to Top