HCF and LCMInvestigateabout 45 min
Predict, test and explain: HCF and LCM patterns
Always, sometimes or never? Find out with your own experiments
Make predictions and test them: when the LCM equals the product, why neighbours are co-prime, how HCF × LCM = a × b holds for two numbers but not three, what scaling does, how remainder puzzles work, and how changing a word problem changes the answer.
In this part you’ll
- Use predictions, tables and counterexamples to test statements about HCF and LCM.
- Discover and explain that HCF × LCM = a × b for two numbers, and find when it fails for three.
- Explain why the HCF of two numbers divides their difference, and use it for consecutive numbers.
- Solve remainder problems by shifting to an HCF or LCM problem.
- Predict how HCF and LCM change when the numbers in a problem change.
In this layer you are the mathematician. Instead of being told a rule, you will make a guess, test it on lots of examples, look for a pattern, and then ask the most important question in mathematics: is it always true, or only sometimes?
Every chapter starts with a question and a prediction. Commit to an answer before you read on. Being wrong is part of the method: a surprising result is the best clue that there is something to explain.
How mathematicians investigate
- Step 01Aska clear question
For example: when is the LCM of two numbers equal to their product?
- Step 02Predictcommit first
Write down what you think will happen, and why.
- Step 03Testmany cases
Try small numbers, big numbers, odd and even numbers, primes and non-primes.
- Step 04Tabulateorganise
Put results in a table so patterns are easy to see.
- Step 05Conjecturestate a rule
A conjecture is a guess that fits all your evidence so far.
- Step 06Hunt for counterexamplestry to break it
One example that breaks a rule is enough to prove the rule false.
- Step 07Explainwhy?
A rule you can explain is much stronger than a rule you have only tested.
Words to know
All maths vocabulary →Investigation words
- conjecture
- A statement you think is true because it fits the evidence, but have not yet proved.
- Example: Conjecture: HCF × LCM = a × b for any two numbers.
- counterexample
- One example that shows a general statement is false.
- Example: 4 and 6 is a counterexample to "LCM is always the product".
- consecutive numbers
- Whole numbers that follow one another with a gap of 1.
- Example: 35 and 36
- pairwise co-prime
- A group of numbers in which every pair has HCF 1.
- Example: 3, 4, 5 are pairwise co-prime; 6, 10, 15 are not.
- always / sometimes / never true
- The three possible verdicts on a statement: true for every case, true for some cases only, or true for no case.
- Example: LCM = a × b is sometimes true.
- scale (a pair)
- Multiply both numbers by the same whole number.
- Example: Scaling 4 and 6 by 10 gives 40 and 60.
- remainder
- What is left after dividing as many whole times as possible.
- Example: 62 ÷ 5 = 12 remainder 2
Chapter 01
When is the LCM equal to the product?
Predict first
Lab
Race two frogs with different jump sizes, predict the first shared stone, and compare it with the product of the jumps.
Numbers: 3 and 4
Text version of this activity
Two frogs start at 0 and jump along numbered stones, each with a fixed jump size. The first stone they share is the LCM. For each pair, compare it with the product of the jumps.
- Jumps 3 and 4: first shared stone 12; product 12; equal. HCF = 1.
- Jumps 4 and 6: first shared stone 12; product 24; product is 2 times the LCM. HCF = 2.
- Jumps 5 and 7: first shared stone 35; product 35; equal. HCF = 1.
- Jumps 6 and 9: first shared stone 18; product 54; product is 3 times the LCM. HCF = 3.
- Jumps 8 and 12: first shared stone 24; product 96; product is 4 times the LCM. HCF = 4.
- Jumps 8 and 9: first shared stone 72; product 72; equal. HCF = 1.
Pattern: the LCM equals the product exactly when the HCF is 1. Otherwise the product is HCF times too big.
| Pair | Product a × b | LCM | Product ÷ LCM | HCF |
|---|---|---|---|---|
| 3, 4 | 12 | 12 | 1 | 1 |
| 4, 6 | 24 | 12 | 2 | 2 |
| 5, 7 | 35 | 35 | 1 | 1 |
| 6, 9 | 54 | 18 | 3 | 3 |
| 8, 12 | 96 | 24 | 4 | 4 |
| 7, 10 | 70 | 70 | 1 | 1 |
| 9, 12 | 108 | 36 | 3 | 3 |
| 10, 15 | 150 | 30 | 5 | 5 |
| 8, 9 | 72 | 72 | 1 | 1 |
| 12, 18 | 216 | 36 | 6 | 6 |
Try it
Chapter 02
When is the HCF one of the numbers?
Predict first
| Pair | Does the smaller divide the larger? | HCF | LCM |
|---|---|---|---|
| 7, 28 | yes | 7 | 28 |
| 6, 30 | yes | 6 | 30 |
| 12, 36 | yes | 12 | 36 |
| 15, 45 | yes | 15 | 45 |
| 8, 20 | no | 4 | 40 |
| 9, 24 | no | 3 | 72 |
| 25, 100 | yes | 25 | 100 |
| 14, 35 | no | 7 | 70 |
The table shows a clean rule: if a divides b, then HCF(a, b) = a and LCM(a, b) = b. When the smaller number does not divide the larger, the HCF is smaller than both, and the LCM is bigger than both.
This gives a quick test for tricky questions. "The HCF of two numbers is 15 and one of them is 15. What can you say?" The other number must be a multiple of 15, and the LCM is that other number.
Chapter 03
Neighbours: numbers next to each other
Predict first
Lab
Test pairs of numbers that are close together and find how their difference limits their HCF.
Numbers: 20 and 21
Text version of this activity
This lab lists the factors of close pairs of numbers and shows their shared prime factors.
- 20 and 21 (difference 1): HCF = 1, LCM = 420. The HCF 1 divides the difference 1.
- 35 and 36 (difference 1): HCF = 1, LCM = 1260. The HCF 1 divides the difference 1.
- 14 and 16 (difference 2): HCF = 2, LCM = 112. The HCF 2 divides the difference 2.
- 21 and 27 (difference 6): HCF = 3, LCM = 189. The HCF 3 divides the difference 6.
- 30 and 35 (difference 5): HCF = 5, LCM = 210. The HCF 5 divides the difference 5.
- 44 and 52 (difference 8): HCF = 4, LCM = 572. The HCF 4 divides the difference 8.
Pattern: the HCF of two numbers always divides their difference. Numbers 1 apart have HCF 1; numbers 2 apart have HCF 1 or 2; numbers 6 apart have HCF 1, 2, 3 or 6.
| Pair | Difference | HCF | Does the HCF divide the difference? |
|---|---|---|---|
| 20, 21 | 1 | 1 | yes |
| 13, 15 | 2 | 1 | yes |
| 14, 16 | 2 | 2 | yes |
| 21, 27 | 6 | 3 | yes |
| 22, 28 | 6 | 2 | yes |
| 25, 31 | 6 | 1 | yes |
| 30, 40 | 10 | 10 | yes |
| 45, 60 | 15 | 15 | yes |
Try it
Chapter 04
Testing the product rule HCF × LCM = a × b
In the first chapter you noticed that the product divided by the LCM was always the HCF. That is the same as saying HCF × LCM = a × b. Before believing it, a good investigator tries to break it: big numbers, primes, equal numbers, numbers where one divides the other, numbers with lots of shared factors.
| a, b | Why chosen | HCF | LCM | HCF × LCM | a × b |
|---|---|---|---|---|---|
| 1, 17 | one number is 1 | 1 | 17 | 17 | 17 |
| 13, 13 | equal numbers | 13 | 13 | 169 | 169 |
| 16, 64 | one divides the other | 16 | 64 | 1,024 | 1,024 |
| 84, 126 | lots shared | 42 | 252 | 10,584 | 10,584 |
| 91, 143 | two-prime products | 13 | 1,001 | 13,013 | 13,013 |
| 210, 330 | larger numbers | 30 | 2,310 | 69,300 | 69,300 |
| 256, 243 | powers of different primes | 1 | 62,208 | 62,208 | 62,208 |
| 360, 588 | three shared primes | 12 | 17,640 | 2,11,680 | 2,11,680 |
Lab
Find the HCF and LCM of larger pairs with any view, and check that HCF × LCM equals the product every time.
Numbers: 84 and 126
Text version of this activity
This lab offers three views of each pair: factor lists, a prime-factor Venn diagram and the division ladder. For each pair, multiply the HCF by the LCM and compare with the product.
- 84 and 126: 84 = 2² × 3 × 7, 126 = 2 × 3² × 7. HCF = 42, LCM = 252. HCF × LCM = 10,584 = 84 × 126.
- 91 and 143: 91 = 7 × 13, 143 = 11 × 13. HCF = 13, LCM = 1,001. HCF × LCM = 13,013 = 91 × 143.
- 210 and 330: 210 = 2 × 3 × 5 × 7, 330 = 2 × 3 × 5 × 11. HCF = 30, LCM = 2,310. HCF × LCM = 69,300 = 210 × 330.
- 360 and 588: 360 = 2³ × 3² × 5, 588 = 2² × 3 × 7². HCF = 12, LCM = 17,640. HCF × LCM = 2,11,680 = 360 × 588.
- 256 and 243: 256 = 2⁸, 243 = 3⁵. HCF = 1, LCM = 62,208. HCF × LCM = 62,208 = 256 × 243.
In the Venn picture: the product uses the overlap twice; so does HCF × LCM (the overlap is in both). That is why the rule never breaks for two numbers.
Chapter 05
Does the product rule work for three numbers?
Predict first
| a, b, c | HCF | LCM | HCF × LCM | a × b × c | Equal? |
|---|---|---|---|---|---|
| 2, 3, 5 | 1 | 30 | 30 | 30 | yes |
| 3, 4, 5 | 1 | 60 | 60 | 60 | yes |
| 5, 7, 9 | 1 | 315 | 315 | 315 | yes |
| 2, 3, 4 | 1 | 12 | 12 | 24 | no |
| 4, 6, 10 | 2 | 60 | 120 | 240 | no |
| 2, 4, 8 | 2 | 8 | 16 | 64 | no |
| 6, 10, 15 | 1 | 30 | 30 | 900 | no |
| 4, 6, 9 | 1 | 36 | 36 | 216 | no |
It works for (2, 3, 5), (3, 4, 5) and (5, 7, 9). In each of those, every pair is co-prime: no two of the numbers share a factor. It fails as soon as any two share a factor, even when the HCF of all three is 1. Look at (6, 10, 15): HCF = 1 and LCM = 30, but the product is 900. Each pair shares a prime (6 and 10 share 2, 6 and 15 share 3, 10 and 15 share 5), and each of those shared primes is counted twice in the product, but it is not in the HCF of all three, so nothing makes up for it.
So the honest statement is: for three numbers, HCF × LCM = a × b × c only when the numbers are pairwise co-prime (and then both sides equal a × b × c with HCF = 1). The Deepen layer shows a correct three-number formula.
Lab
Place the prime factors of three numbers in a three-circle Venn diagram to see which primes are shared by two numbers but not all three.
Numbers: 6, 10 and 15
The HCF is 1, so these numbers are co-prime: they share no factor except 1.
Split each number into primes: 6 = 2 × 310 = 2 × 515 = 3 × 5
- Only in 6: nothing
- Only in 10: nothing
- Only in 15: nothing
- Shared by 10 and 15 only: 5
- Shared by 6 and 10 only: 2
- Shared by 6 and 15 only: 3
- In all three (the centre): nothing
HCF = multiply the centre = 1 (nothing shared) = 1
LCM = multiply everything in the picture = 2 × 3 × 5 = 30
Text version of this activity
This lab places the prime factors of three numbers in three overlapping circles: the centre holds primes shared by all three; the three petal regions hold primes shared by exactly two.
- 6, 10, 15: 6 = 2 × 3, 10 = 2 × 5, 15 = 3 × 5. HCF (centre) = 1, LCM (everything) = 30, product = 900.
- 4, 6, 10: 4 = 2², 6 = 2 × 3, 10 = 2 × 5. HCF (centre) = 2, LCM (everything) = 60, product = 240.
- 2, 4, 8: 2 = 2, 4 = 2², 8 = 2³. HCF (centre) = 2, LCM (everything) = 8, product = 64.
- 3, 4, 5: 3 = 3, 4 = 2², 5 = 5. HCF (centre) = 1, LCM (everything) = 60, product = 60.
For 6, 10, 15 the centre is empty but each petal has a prime (2, 3, 5): those primes are counted twice in the product and only once in the LCM. For 3, 4, 5 there are no shared primes at all, and HCF × LCM = product.
Chapter 06
What happens when you scale the numbers?
Predict first
| k | Numbers 4k, 6k | HCF | LCM | HCF ÷ k | LCM ÷ k |
|---|---|---|---|---|---|
| 1 | 4, 6 | 2 | 12 | 2 | 12 |
| 2 | 8, 12 | 4 | 24 | 2 | 12 |
| 3 | 12, 18 | 6 | 36 | 2 | 12 |
| 5 | 20, 30 | 10 | 60 | 2 | 12 |
| 10 | 40, 60 | 20 | 120 | 2 | 12 |
| 25 | 100, 150 | 50 | 300 | 2 | 12 |
Try it
Chapter 07
Remainder puzzles: shifting by a fixed amount
Some of the most famous textbook problems use the same remainder trick. Investigate this one:
Find the smallest number that leaves remainder 2 when divided by 3, 4 and 5.
Try listing numbers that leave remainder 2 when divided by 5: 7, 12, 17, 22, 27, 32, 37, 42, 47, 52, 57, 62, … Now test each with 3 and 4. The first one that works is 62.
Why 62? Take 2 away and you get 60, which is divisible by 3, 4 and 5. In fact 60 = LCM(3, 4, 5). So the rule is: smallest number = LCM + remainder. And the next ones are 60 × 2 + 2 = 122, 60 × 3 + 2 = 182, and so on.
Predict first
Worked example
0 / 5 steps shownDifferent remainders with a hidden pattern
Find the smallest number that leaves remainders 3, 4 and 5 when divided by 5, 6 and 7 respectively.
| Problem | Trick | Uses | Answer |
|---|---|---|---|
| Smallest number leaving remainder 2 when divided by 3, 4, 5 (other than 2) | Subtract the same remainder | LCM + 2 | 62 |
| Largest number dividing 43 and 91 leaving remainder 7 | Subtract the remainder from each | HCF(36, 84) | 12 |
| Smallest number leaving remainders 3, 4, 5 when divided by 5, 6, 7 | Same shortfall 2 | LCM − 2 | 208 |
| Largest number dividing 70 and 125 leaving remainders 5 and 8 | Subtract each remainder | HCF(65, 117) | 13 |
| Smallest 4-digit number divisible by 12, 15 and 20 | Multiples of LCM 60 | Next multiple of 60 after 999 | 1,020 |
Try it
Chapter 08
Counting common multiples
How many numbers from 1 to 100 are divisible by both 4 and 6?
Your first guess might be to count multiples of 4 (there are 25) and multiples of 6 (there are 16) and do something with them. But a number divisible by both 4 and 6 is a common multiple, and every common multiple is a multiple of the LCM, which is 12. So the question is really "how many multiples of 12 are there up to 100?" The answer is 100 ÷ 12 = 8 remainder 4, so 8: 12, 24, 36, 48, 60, 72, 84, 96.
A common wrong answer is to count multiples of 4 × 6 = 24: that gives only 4, and misses 12, 36, 60 and 84.
Predict first
Chapter 09
Word-problem detective: what if the numbers change?
Investigating is not just for pure numbers. Take the courtyard from Discover, 240 cm × 180 cm, which needed 60 cm tiles. What if the courtyard changes?
- Make it 250 cm × 180 cm (10 cm longer). Now HCF(250, 180) = 10 cm. A tiny change made the best tile six times smaller, and you would need 450 tiles instead of 12.
- Make it 300 cm × 180 cm. HCF(300, 180) = 60 cm, back to large tiles: 15 tiles.
This is why tilers and carpenters love "round" measurements like 240, 300 and 360: they have lots of factors, so many tile sizes fit.
Predict first
| Bus B every… | HCF(15, B) | LCM(15, B) = together every… |
|---|---|---|
| 10 min | 5 | 30 min |
| 12 min | 3 | 60 min |
| 14 min | 1 | 210 min |
| 18 min | 3 | 90 min |
| 20 min | 5 | 60 min |
| 25 min | 5 | 75 min |
| 30 min | 15 | 30 min |
| 45 min | 15 | 45 min |
Lab
Sort statements about HCF and LCM into always, sometimes and never true, using examples and counterexamples.
Is each statement about whole numbers always true, sometimes true, or never true?
12 cards, 3 bins. Tap a card, then tap its bin. You can also drag, or press a bin’s number key.
Text version of this activity
This game has twelve statements to sort into "Always true", "Sometimes true" and "Never true".
Always true: HCF × LCM = a × b for two numbers; consecutive numbers have HCF 1; the HCF divides the LCM; two consecutive even numbers have HCF 2; multiplying both numbers by 3 multiplies the HCF by 3.
Sometimes true: LCM = a × b (only for co-primes, like 5 and 7, not 4 and 6); HCF × LCM = product for three numbers (true for 3, 4, 5 but not 2, 4, 8); the HCF equals one of the numbers (only when one divides the other); two composite numbers are co-prime (8 and 9 yes, 4 and 6 no).
Never true: the HCF is bigger than both numbers; two even numbers are co-prime; the LCM is smaller than one of the numbers.
For "sometimes", give one example where it works and one where it fails.
Chapter 10
Primes, squares and changing the story
Predict first
| p, n | Does p divide n? | HCF | LCM |
|---|---|---|---|
| 7, 30 | no | 1 | 210 |
| 7, 42 | yes | 7 | 42 |
| 11, 60 | no | 1 | 660 |
| 11, 121 | yes | 11 | 121 |
| 13, 100 | no | 1 | 1300 |
| 13, 65 | yes | 13 | 65 |
| 5, 5 | yes | 5 | 5 |
| 2, 99 | no | 1 | 198 |
Predict first
| Squares | HCF | LCM | HCF is | LCM is |
|---|---|---|---|---|
| 36, 100 | 4 | 900 | 2² | 30² |
| 16, 36 | 4 | 144 | 2² | 12² |
| 81, 144 | 9 | 1,296 | 3² | 36² |
| 100, 225 | 25 | 900 | 5² | 30² |
| 64, 144 | 16 | 576 | 4² | 24² |
| 49, 25 | 1 | 1,225 | 1² | 35² |
Investigating also means asking "what if?" about a word problem. A sweet shop packs 24 laddoos with some barfis into identical boxes, using the most boxes possible. How does the number of boxes change with the number of barfis?
The number of boxes is HCF(24, barfis). With 36 barfis it is 12; with 30 barfis 6; with 25 barfis only 1, a single big box, because 24 and 25 are neighbours. With 48 barfis it is 24, because 24 divides 48. Tiny changes in a count can change the answer enormously.
| Barfis | Most boxes = HCF(24, barfis) | Laddoos per box | Barfis per box |
|---|---|---|---|
| 25 | 1 | 24 | 25 |
| 30 | 6 | 4 | 5 |
| 32 | 8 | 3 | 4 |
| 36 | 12 | 2 | 3 |
| 40 | 8 | 3 | 5 |
| 42 | 6 | 4 | 7 |
| 48 | 24 | 1 | 2 |
| 60 | 12 | 2 | 5 |
Try it
Try it
Try it
Chapter 11
A grid investigation: the diagonal
Here is a classic investigation that seems to have nothing to do with HCF, until it does.
Draw a rectangle on squared paper, m squares wide and n squares tall. Draw a straight line from the bottom-left corner to the top-right corner. How many squares does the line pass through (through the inside, not just touching a corner)?
Try a 2 × 3 rectangle: the diagonal passes through 4 squares. A 4 × 6 rectangle: 8 squares, not twice as many. A 5 × 5 square: just 5, straight along the diagonal squares.
Predict first
| m × n | m + n | HCF(m, n) | Squares crossed | m + n − HCF |
|---|---|---|---|---|
| 2 × 3 | 5 | 1 | 4 | 4 |
| 3 × 4 | 7 | 1 | 6 | 6 |
| 4 × 6 | 10 | 2 | 8 | 8 |
| 5 × 5 | 10 | 5 | 5 | 5 |
| 6 × 9 | 15 | 3 | 12 | 12 |
| 4 × 10 | 14 | 2 | 12 | 12 |
| 8 × 12 | 20 | 4 | 16 | 16 |
| 12 × 18 | 30 | 6 | 24 | 24 |
Try it
Chapter 12
What did the investigation find?
Lab
Match each investigation question to the pattern or answer you discovered.
Match each investigation to what it found.
8 pairs are hiding in two mixed-up columns. Pick one from each side to join them.
Text version of this activity
This game connects eight investigation questions to their findings:
- Product ÷ LCM of two numbers → always equals the HCF.
- HCF of consecutive numbers → always 1.
- HCF of consecutive even numbers → always 2.
- HCF of two numbers 9 apart → divides 9, so it is 1, 3 or 9.
- HCF × LCM for 6, 10, 15 → 1 × 30 = 30, but the product is 900.
- HCF(40, 60) compared with HCF(4, 6) → 20 is 10 times 2.
- Numbers up to 100 divisible by both 4 and 6 → 8, the multiples of LCM 12.
- Smallest number above 2 leaving remainder 2 on division by 3, 4 and 5 → 62 = 60 + 2.
Quick check
Investigation check
8 questions · answer what you can, then check. Getting one wrong is useful.
Keep this
What the investigations found
- Product ÷ LCM = HCF for two numbers, so HCF × LCM = a × b. LCM = a × b only when HCF = 1.
- If a divides b: HCF = a and LCM = b.
- The HCF divides the difference of the two numbers. Consecutive numbers: HCF 1. Consecutive odd: 1. Consecutive even: 2.
- The HCF divides the LCM, and LCM ÷ HCF = (a ÷ HCF) × (b ÷ HCF).
- Three numbers: HCF × LCM = product only when the numbers are pairwise co-prime. (6, 10, 15) is the classic counterexample.
- Scaling: multiply both numbers by k and both the HCF and the LCM are multiplied by k.
- Same remainder r: smallest number = LCM + r (bigger than the divisors); largest divisor = HCF of the numbers minus r.
- Same shortfall s: when each remainder is s less than its divisor, the number is LCM − s.
- Counting: numbers up to N divisible by both a and b = N ÷ LCM(a, b), rounded down.
- Diagonal of an m × n grid passes through m + n − HCF(m, n) squares.
Reflect
This stays on this page only. It isn’t saved or sent anywhere.
Related to
Number and shape patternsCommon multiples repeat every LCM, and remainder answers form a pattern: 2, 62, 122, 182…
Related to
Properties of numbersThe rule that a common factor divides the difference is a divisibility property you can use far beyond HCF.
Helps you understand
Prime and composite numbersCo-primes, twin primes and consecutive numbers all show up in the HCF investigations.
Where this comes from
Sources
Ganita Prakash: Mathematics Textbook for Grade 6, Chapter 5: Prime Time (opens another website) — NCERTawaiting owner check
Supports the Class 6 syllabus treatment of factors, multiples, common factors, common multiples, co-prime numbers and prime factorisation. Note: this 2024 textbook builds the ideas but does not use the terms HCF and LCM, which now appear later in the syllabus.
Mathematics Textbook for Class X, Chapter 1: Real Numbers (opens another website) — NCERTawaiting owner check
Supports the Fundamental Theorem of Arithmetic, Euclid's division algorithm, HCF as the product of smallest powers of common primes, LCM as the product of greatest powers, and HCF × LCM = product for two numbers but not for three.
Greatest common divisor (opens another website) — Wikipediaawaiting owner check
Reference for properties of the GCD: every common divisor divides the GCD, gcd(a, 0) = |a|, co-prime numbers, the gcd × lcm identity for two numbers and Bézout’s identity.
Least common multiple (opens another website) — Wikipediaawaiting owner check
Reference for properties of the LCM: common multiples of two numbers are the multiples of their LCM, the prime-power (Venn) method, the recursive identity for three or more numbers, and the gear and planetary-alignment examples.
Factors and multiples (6th grade) (opens another website) — Khan Academyawaiting check
Intended to support practice-level explanations of GCF and LCM, including word problems that ask learners to choose between them. NOT CHECKED: khanacademy.org returns a bot-challenge page, so no agent has read the body. Open it by hand before approving.
Factors, Multiples and Primes (Age 11-16) (opens another website) — NRICH, Millennium Mathematics Project, University of Cambridgeawaiting owner check
A curated collection of problems on factors, multiples, primes, HCF and LCM for ages 11-16 (Factors and Multiples Game, LCM Sudoku, Counting Factors and others). Supports the problem-solving and 'which one does this need?' tasks in these layers.
End of Investigate
What you just read
- Use predictions, tables and counterexamples to test statements about HCF and LCM.
- Discover and explain that HCF × LCM = a × b for two numbers, and find when it fails for three.
- Explain why the HCF of two numbers divides their difference, and use it for consecutive numbers.
- Solve remainder problems by shifting to an HCF or LCM problem.
- Predict how HCF and LCM change when the numbers in a problem change.
- Next depthGo deeper: Go deeperMechanisms, reasoning, calculations and nuance.
- Practise79 questionsHints and a worked solution for every question — or play a 10-question round.
- Step backUnderstandGo back over the ground before this one — you can move up and down as often as you like.
- TopicAll of hcf and lcmThe whole ladder, the connections and the words to know, on one page.
The web
Explore a connection
Builds on
Prime and composite numbersPrime factorisation is the fastest route to both the HCF and the LCM.
Used in
Number and shape patternsTwo repeating cycles line up again after their LCM — the pattern behind blinking lights and bus timetables.
Used in
Shape and spaceThe largest square tile that fits a rectangular floor exactly has a side equal to the HCF of its length and width.
Want to save topics or ask for new ones? Invited families can connect a learning device. Everything here stays free to read without signing in.
Revision 1 · release preview-7e1cbbcc4f · accepted 20/09/2026