Skip to content
Procedure

LCM and HCF of several numbers from prime powers

Arithmetic • Number System • LCM and HCF

Statement

Factorise every number into primes. The LCM is the product of each prime raised to the HIGHEST power in which it appears in any of them; the HCF is the product of each prime raised to the LOWEST power in which it appears in ALL of them, a prime missing from any one number being omitted entirely.

How to use it

  1. 1Works for any count of numbers, unlike the two-number identity .
  2. 2Lay the factorisations in a column with one prime per position, so the highest and lowest powers can be read off by eye.
  3. 3A prime that appears in only one of the numbers still enters the LCM, but never the HCF.
  4. 4Events that repeat every , and units coincide again after units — this is the standard route for bells, lights, or runners returning together to a starting point.

Worked example

Find the LCM and the HCF of , and .

Step-by-step

  1. 1

    Why: Factorise each number into primes.

  2. 2

    Why: Highest power of each prime seen anywhere: from , from , from .

  3. 3

    Why: Lowest power present in all three; is dropped because and do not contain it.

Answer

,

Watch out

Taking the highest power for the HCF, or the lowest for the LCM, is the usual slip. The pair identity does not extend to three or more numbers, so do not use it as a shortcut here.

Builds on

Also known as

lcm by prime factorisation, hcf by prime factorisation, highest power rule, lcm of three numbers, gcd of several numbers

Appears in past papers

2020 (I)