What is the least common multiple?
The least common multiple of a set of whole numbers is the smallest positive number that is a multiple of every number in the set. A multiple of 6 is anything you reach by counting by sixes (6, 12, 18, 24 and so on), and a multiple of 4 is anything reached by counting by fours (4, 8, 12, 16...). The first value on both lists is 12, so the LCM of 4 and 6 is 12. It is also called the lowest common multiple or smallest common multiple.
LCMs show up whenever two repeating cycles need to line up. If one bus leaves every 12 minutes and another every 18 minutes, both depart together every 36 minutes, because 36 is the LCM of 12 and 18. The same idea is what lets you add fractions: the least common denominator of 5/12 and 7/18 is 36.
Three ways to find it
Listing multiples
Write out multiples of each number until one value turns up in every list. For 18 and 26 the multiples of 18 run 18, 36, 54, and so on, while those of 26 run 26, 52, 78, and so on. The two lists first meet at 234. This works fine for small numbers but gets slow when the answer is large, so the calculator shows the full list only when it is short and abbreviates it otherwise.
Prime factorization
Break each number into primes, then build the LCM from every prime at the highest power it reaches in any single number. For 21, 14 and 38:
- 21 = 3 × 7
- 14 = 2 × 7
- 38 = 2 × 19
The primes involved are 2, 3, 7 and 19, each appearing to the first power at most, so LCM = 2 × 3 × 7 × 19 = 798.
Using the greatest common divisor
For two numbers, the product of the LCM and the GCD equals the product of the numbers themselves:
For more than two numbers, apply that identity step by step: find LCM of the first two, then the LCM of that result with the third, and so on. With 21, 14 and 38: GCD(14, 38) = 2, so LCM(14, 38) = 266; then GCD(266, 21) = 7, so LCM(266, 21) = 798. Same answer, and this route stays quick even for huge numbers because the Euclidean algorithm never needs factoring.
Worked example with four numbers
Take 330, 75, 450 and 225. Their factorizations are 330 = 2 × 3 × 5 × 11, 75 = 3 × 5 × 5, 450 = 2 × 3 × 3 × 5 × 5 and 225 = 3 × 3 × 5 × 5. The highest powers are 2 (once), 3 (twice), 5 (twice) and 11 (once), so the LCM is 2 × 9 × 25 × 11 = 4,950. Every input divides 4,950 exactly, and no smaller positive number does.
Useful facts
| Situation | LCM |
|---|---|
| One number divides the other (for example 6 and 18) | The larger number |
| Numbers share no prime factor (for example 8 and 15) | Their product |
| Consecutive integers n and n + 1 | n × (n + 1) |
| Any set containing 1 | The LCM of the other numbers |
LCM and GCD together
The two ideas mirror each other. The GCD uses the lowest power of each shared prime, while the LCM uses the highest power of every prime that appears. That is why the calculator reports both numbers: if you know one for a pair, the other follows from the product rule above.
Common mistakes
- Multiplying all the numbers together gives a common multiple, but usually not the least one.
- Forgetting that a prime repeated within one number counts at its full power (75 contributes 5 × 5, not a single 5).
- Mixing up LCM and GCD: the LCM is never smaller than the largest input, while the GCD is never larger than the smallest.
Enter your own list above to see the work for any set of up to thirty numbers.