How this calculator works
Combine the running LCM with one input at a time, dividing by their GCF before multiplying. Exact integer arithmetic keeps long results intact. The prime method takes the greatest exponent of each prime across the inputs. The multiples method lists ten multiples of the final answer. Negative inputs use their magnitudes. If any entry is zero the result is zero by convention, and there are no positive common multiples to list.
Formula
lcm(a,b)=|a|/gcd(|a|,|b|) × |b| for non-zero a,b. Repeat across the list. Equivalently take the maximum exponent of each prime.
Worked example
For 6, 10 and 15, first lcm(6,10)=6/2×10=30. Then lcm(30,15)=30/15×15=30. The prime powers required are 2, 3 and 5.
Advertisement
Frequently asked questions
How many numbers can I compare?
Enter 2 through 15 integers, each with magnitude at most one billion.
Why display the answer as text?
A many-number LCM can exceed the exact integer range of ordinary floating-point numbers. The full integer is preserved.
What if the list contains 1?
One adds no prime factors and does not change the LCM of the other entries.