LCM
The least common multiple LCM(a, b) is the smallest positive integer that both a and b divide into. By prime factorisation, take each prime that appears in either number raised to its highest power. For 12 = 2²·3 and 18 = 2·3², use 2² and 3², giving LCM = 4 × 9 = 36. LCM answers "when do repeating cycles line up?" — two buses that leave every 12 and 18 minutes next depart together after 36 minutes; it is also the right common denominator when adding fractions. Contrast it with GCD: GCD is at most the smaller number, LCM is at least the larger. The GRE frequently disguises LCM as a scheduling or "meet again" word problem, so when two independent cycles must coincide, reach for LCM.
✅ 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
Divisibility tests
| By 2 | last digit even |
|---|---|
| By 3 | digit sum divisible by 3 |
| By 4 | last two digits divisible by 4 |
| By 5 | ends in 0 or 5 |
| By 9 | digit sum divisible by 9 |
GCD & LCM
| GCD × LCM | GCD(a,b) × LCM(a,b) = a × b |
|---|---|
| LCM from GCD | LCM = (a × b) / GCD |
| Coprime numbers | GCD = 1 ⇒ LCM = a × b |
| Divisibility by 6 | divisible by 2 AND by 3 |