LCM Applications
Two CAT staples live here. First, LCM of fractions: the rule is LCM = LCM(of numerators) / HCF(of denominators), and symmetrically HCF of fractions = HCF(numerators)/LCM(denominators). Reduce each fraction first. Second, the "events recurring together" family: if bells ring at intervals of a, b, c seconds and start together, they next ring together after LCM(a,b,c) seconds, and the count of times in T seconds is T/LCM (plus the start instant if asked). Third, the "least number leaving remainder r" problem: the smallest number that leaves the SAME remainder r when divided by several divisors is LCM(divisors) + r, and the general form is LCM·k + r. If instead each divisor leaves a remainder that is a constant LESS than the divisor (e.g. always 2 short), the number is LCM − (common deficit). Set the unknown as LCM·k + r and solve for k to fit any extra condition.
✅ 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) |