LCM Calculator
LCM = 0
| Step | Running LCM | Next Number | GCF(running, next) | New LCM |
|---|
How the Least Common Multiple Is Calculated
The least common multiple (LCM) of a set of integers is the smallest positive integer that is evenly divisible by every number in the set. This calculator uses the standard identity LCM(a, b) = |a × b| / GCF(a, b), where the greatest common factor is found with the Euclidean algorithm (repeated remainder division, not a slow trial-and-error search). For three or more numbers, the LCM is built up pairwise: LCM(a, b, c) = LCM(LCM(a, b), c), and so on, which is mathematically equivalent to finding the LCM of the whole set at once.
LCM vs. GCF: Two Related but Different Questions
The LCM answers "what's the smallest number all of these divide into?" while the greatest common factor answers "what's the largest number that divides into all of these?" They're computed from each other via the identity above, which is why this calculator reports both. If you only need the greatest common factor on its own — for example to simplify a fraction to lowest terms — the GCF calculator is the more direct tool.
Where LCM Shows Up in Practice
The most common everyday use is adding or subtracting fractions with different denominators: the LCM of the denominators gives you the smallest common denominator to convert to, avoiding unnecessarily large numbers. It's also used for scheduling problems (e.g. "these two events repeat every 4 and 6 days — when do they next coincide?") and in number theory more generally. If your actual goal is fraction arithmetic rather than finding the LCM itself, the fraction calculator will do that conversion and the arithmetic for you automatically.
Frequently Asked Questions
How do you find the LCM of more than two numbers?
Find the LCM of the first two numbers, then find the LCM of that result and the next number, and repeat until all numbers are used. This calculator does exactly that, showing each pairwise step, since LCM(a, b, c) is mathematically the same as LCM(LCM(a, b), c).
What is the relationship between LCM and GCF?
For any two positive integers a and b, LCM(a, b) x GCF(a, b) = a x b. This calculator uses that identity directly: it computes the GCF with the Euclidean algorithm, then divides the product of the two numbers by that GCF to get the LCM.