The least common multiple (LCM) of two or more numbers is the smallest number that all of them divide into evenly. The LCM of 4 and 6 is 12: it's the smallest number both 4 and 6 divide evenly into, even though larger shared multiples exist too (24, 36, 48...) — 12 is simply the smallest of that shared, infinite set.
The Prime-Factorization Method for LCM
The most reliable method is prime factorization, and it mirrors the GCF method with one key difference: instead of taking the lower shared power of each prime, LCM takes the *higher* power of every prime that appears in either number's factorization. For 4 = 2² and 6 = 2 × 3, the primes involved are 2 and 3; taking the higher power of each (2² from 4, since 6 only has 2¹) and including 3¹ (which only appears in 6) gives 2² × 3 = 12.
Worked example one: LCM of 8 and 12. 8 = 2³, 12 = 2² × 3. Higher power of 2 is 2³ (from 8), plus 3¹ (from 12, since 8 has none): 2³ × 3 = 24. Worked example two: LCM of 6 and 15. 6 = 2 × 3, 15 = 3 × 5. Combine all primes at their highest power: 2¹ × 3¹ × 5¹ = 30.
A shortcut once you already know the GCF: GCF × LCM = the product of the two original numbers. For 12 and 18, the GCF is 6 (see the GCF Calculator), and 12 × 18 = 216, so LCM = 216 ÷ 6 = 36 — which checks out against the prime-factorization method (12 = 2² × 3, 18 = 2 × 3²; higher powers give 2² × 3² = 36). This identity only holds for exactly two numbers, not three or more, which is a common point of confusion when someone tries to extend the shortcut to a larger set.
The Most Common Real-World Use: Common Denominators
LCM's most common real-world use is finding a common denominator when adding or subtracting fractions with different denominators — 1/4 + 1/6 needs a shared denominator, and the smallest one that works is the LCM of 4 and 6, which is 12 (giving 3/12 + 2/12 = 5/12). Using a larger common multiple than necessary (like 24, also shared by both) still produces a correct final answer after simplifying, but requires an extra simplification step at the end that the LCM avoids.
LCM extends to three or more numbers the same way GCF does: find it pairwise and combine — LCM(4, 6, 10) is found by first taking LCM(4,6) = 12, then LCM(12,10) = 60. A classic scheduling application: if one event repeats every 4 days and another every 6 days, both events coincide again after LCM(4,6) = 12 days — the same logic used for anything that recurs on different cycles and needs a "when do they line up again" answer, from bus schedules to blinking lights.
Common Mistakes With LCM
As with GCF, the most common mistake is confusing which of the two calculations a problem is actually asking for — LCM answers "smallest shared multiple" and is always at least as large as the bigger input number, while GCF answers "largest shared divisor" and is always at most as large as the smaller input number. When two numbers are coprime (GCF = 1, meaning they share no prime factors), their LCM is simply their product — LCM(8,9) = 72, since GCF(8,9) = 1 and 8×9÷1 = 72. This is the fastest possible case for the GCF×LCM=product shortcut, and it's worth recognizing coprime pairs at a glance (numbers with no shared small prime factors between them) as a shortcut in its own right, skipping the full factorization step entirely.
For the underlying method with more worked examples, see What Is LCM, and How Do You Find It?