LCM by Factorization
Write each number as a product of primes, then take every prime that appears in any number, each raised to its HIGHEST power across the set — multiply those together and you have the LCM. For 12 = 2²×3 and 18 = 2×3², the LCM uses 2² (highest power of 2) and 3² (highest power of 3), giving 4×9 = 36. Contrast this with HCF, which takes the LOWEST power of only the COMMON primes (here 2¹×3¹ = 6). The factor method is faster and far less error-prone than the school "ladder" division when the numbers are coprime or have large factors, and it is the only safe method when CAT mixes in powers like 2⁴ or 5³. A clean check: the LCM must be divisible by every number in the set, and it can never be smaller than the largest number given.
✅ Solved examples
✏️ Practice — try these, take hints as needed
📝 Topic test — 8 questions
Auto-graded with full solutions; saved to your dashboard. Use the calculator and formula sheet (top-right) any time.
Formula Reference Sheet
Core LCM & HCF
| LCM by factorisation | LCM = product of each prime to its HIGHEST power |
|---|---|
| HCF by factorisation | HCF = product of each common prime to its LOWEST power |
| HCF–LCM identity (two numbers) | HCF(a,b) × LCM(a,b) = a × b |
| Missing LCM | LCM = (a × b) / HCF |
| Missing number | b = (HCF × LCM) / a |
Fractions & applications
| LCM of fractions | LCM(numerators) / HCF(denominators) |
|---|---|
| HCF of fractions | HCF(numerators) / LCM(denominators) |
| Bells ring together | gap = LCM of the individual intervals |
| Least number, same remainder r | N = LCM(divisors) × k + r |
| Least number, exactly divisible | N = LCM(divisors) (the case r = 0) |