About the LCM
Two gears with different tooth counts, buses on different schedules, fractions with different denominators — “when do they line up?” is always the least common multiple. It's the mirror image of the GCF: instead of the biggest thing inside both numbers, the smallest thing both fit into.
Enter two or more whole numbers for the LCM, verification that each divides it (with the multiplier shown), and the GCF alongside. The pairing isn't decoration — fraction work uses LCM to build common denominators and GCF to reduce the result.
That other half lives in the GCF Calculator.
The GCF Identity Method
Skip the multiple-listing; use the identity:
LCM(a, b) = a × b ÷ GCF(a, b) Multiple numbers: fold left — LCM(a, b, c) = LCM(LCM(a, b), c)
Worked example: LCM(4, 6) = 24 ÷ GCF(4,6) = 24 ÷ 2 = 12 — the first number in both the 4s and 6s tables. Larger case: LCM(24, 36, 60) folds to 360. The identity turns a search problem into one multiplication and one Euclid run.
Worked Examples
Common cases — each computed by this calculator:
| Numbers | LCM | GCF | Check (GCF × LCM) |
|---|---|---|---|
| 4, 6 | 12 | 2 | 24 = 4 × 6 ✓ |
| 6, 8 | 24 | 2 | 48 = 6 × 8 ✓ |
| 3, 5 | 15 | 1 | 15 = 3 × 5 ✓ |
| 12, 18 | 36 | 6 | 216 = 12 × 18 ✓ |
| 3, 5, 15 | 15 | 1 | — |
| 24, 36, 60 | 360 | 12 | — |
Coprime numbers (GCF 1) have LCM = their product — no overlap to save. The check column's identity only holds for pairs, not longer lists.
Where LCM Shows Up
Fraction addition is the daily customer: 1/4 + 1/6 needs the denominators' LCM (12) — anything larger works but simplifies back; the LEAST common multiple keeps arithmetic small. Every “find a common denominator” instruction is an LCM computation wearing a disguise.
Alignment problems are the other family: two buses leaving every 12 and 18 minutes coincide every 36; three machines cycling at different rates re-sync at their LCM; recurring schedules (every 3rd day vs every 5th) collide every 15th. When the question is “when does it all happen at once again?”, this is the tool.