Revision notes

Chapter 3 Finding Common Ground: Foundation

The key points, rules to remember, tables and diagrams from all 5 lessons, on one page for quick revision. To keep a copy, use your browser's Print and choose "Save as PDF".

Lesson 1

Common factors and the HCF

The Highest Common Factor (HCF) of two or more numbers is the greatest of their common factors. It is also called the Greatest Common Divisor (GCD).

Solving an HCF problem by listing

  1. Spot the clue Equal pieces, tiles or bags that must fit exactly, as large as possible.
  2. List factors Write all the factors of each number.
  3. Find common ones Keep the factors that appear in every list.
  4. Pick the greatest That is the HCF.
  5. Answer the question Divide to find how many pieces, tiles or bags.
HCF problems look different but ask the same thing
ProblemWhat must divide exactlyWhy we want the HCF
Square tiles on a floorBoth side lengthsBigger tiles mean fewer tiles
Equal pieces from two ribbonsBoth ribbon lengthsLongest possible pieces
Equal bags from two heapsBoth weightsFewest bags

Key takeaways: common factors divide every number in the group, and the HCF is the greatest of them. If the only common factor is 1, the numbers are co-prime. Problems asking for the largest equal size that fits exactly are HCF problems.

Read the full lesson

Lesson 2

Prime factorisation and the factors it hides

Every whole number greater than 1 can be written as a product of primes in exactly one way, apart from the order of the factors.

Division method for 1,050

  1. 1,050 ÷ 2 = 525 2 is the smallest prime that divides 1,050.
  2. 525 ÷ 3 = 175 525 is odd; its digit sum 12 is divisible by 3.
  3. 175 ÷ 5 = 35 It ends in 5.
  4. 35 ÷ 5 = 7 It ends in 5 again.
  5. 7 is prime Stop. 1,050 = 2 × 3 × 5 × 5 × 7.

A number is a factor of N exactly when its prime factors can all be picked out of N's prime factorisation (each prime used no more times than it appears).

Size does not decide the length of a factorisation
NumberPrime factorisationHow many primes
642 × 2 × 2 × 2 × 2 × 26
14311 × 132
1802 × 2 × 3 × 3 × 55

Key takeaways: every number above 1 has one prime factorisation, found quickly by the division method. Any factor is a sub-product of those primes, which lets you test factors and list them all without missing any. One counterexample is enough to disprove a conjecture.

Read the full lesson

Lesson 3

Finding the HCF using prime factorisation

To find the HCF, write each prime factorisation, take every prime that appears in all of them, use it the smallest number of times it appears in any one number, and multiply.

Building the HCF of 126 and 180
PrimeTimes in 126Times in 180Times in the HCF (minimum)
2121
3222
5010
7100

HCF by prime factorisation

  1. Factorise Write each number as a product of primes.
  2. Find shared primes Keep only primes that appear in every number.
  3. Take the minimum Use each shared prime as few times as it appears in any number.
  4. Multiply The product is the HCF; if nothing is shared, the HCF is 1.

Key takeaways: a common factor is a sub-product of every factorisation. The HCF uses each shared prime the minimum number of times. If no prime is shared, the HCF is 1. Never judge common factors from a split into composite numbers.

Read the full lesson

Lesson 4

Common multiples and the LCM

The Lowest Common Multiple (LCM) of two or more numbers is the smallest number that is a multiple of each of them.

To find the LCM, take every prime that appears in any of the numbers, use it the largest number of times it appears in any one number, and multiply.

HCF and LCM from prime factorisations

  • HCF
    • Uses only primes found in every number
    • Each prime the minimum number of times
    • Divides each number
    • Answers 'largest equal piece' questions
  • LCM
    • Uses every prime found in any number
    • Each prime the maximum number of times
    • Is a multiple of each number
    • Answers 'when do they meet again' questions
HCF or LCM?
Clue in the problemUsually needs
Largest equal size that fits exactlyHCF
Fewest tiles, bags or piecesHCF
When will they happen together again?LCM
Shortest length both can makeLCM

Key takeaways: common multiples go on for ever; the LCM is the smallest. Every common multiple contains each number's full prime factorisation, so the LCM takes each prime the maximum number of times it appears. 'Together again' and 'shortest length both can make' point to the LCM.

Read the full lesson

Lesson 5

HCF and LCM patterns, a quick procedure and HCF × LCM

The shared division ladder

  1. Write both numbers Side by side on one line.
  2. Divide by a common factor Write both quotients on the next line.
  3. Repeat Until the two numbers left have no common factor except 1.
  4. Read the HCF Multiply all the divisors on the left.
  5. Read the LCM Multiply the HCF by the two numbers left at the bottom.

For any two numbers a and b: HCF(a, b) × LCM(a, b) = a × b.

In every row, HCF × LCM = product
PairHCFLCMProduct
6 and 18618108
14 and 151210210
14 and 162112224
120 and 1682484020,160

Key takeaways: consecutive numbers have HCF 1; consecutive even numbers have HCF 2; if one number divides the other, the HCF is the smaller and the LCM the larger. A shared division ladder gives the HCF (divisors multiplied) and the LCM (HCF × numbers left). HCF × LCM equals the product of the two numbers, and the HCF always divides the LCM.

Read the full lesson

Privacy · Terms · Refunds · Delivery