How the Least Common Multiple Calculator works.
lcm(a,b) = |a × b| ÷ gcd(a,b)The comma-, space-, or line-separated inputs are positive whole numbers; the result is the first positive integer divisible by each.
Worked example for the Least Common Multiple Calculator.
The least common multiple of 12 and 18 is 36 because 36 is the first positive number divisible by both.
How to read this result.
The result gives the first shared cycle for positive whole-number intervals or denominators.
How the calculation works
LCM is the smallest positive integer divisible by every input; it can be found from the product divided by the GCF, applied safely across a list. Formula or rule: lcm(a,b) = |a × b| ÷ gcd(a,b). The comma-, space-, or line-separated inputs are positive whole numbers; the result is the first positive integer divisible by each.
What this calculator does not prove
LCM applies to integers. It should not be used to synchronize arbitrary real-valued durations without first defining a meaningful integer unit. Use the result for the mathematical question shown here; a correct calculation does not by itself establish that the source data, sample, or real-world assumption is appropriate.
Inputs and edge cases to check.
Enter 2–100 positive whole numbers. Decimals, zeros, blank items, and values that make the result exceed the supported safe range are rejected. Convert intervals to the same whole-number unit before using LCM to compare when their cycles coincide.
What this tool does not include.
LCM applies to integers. It should not be used to synchronize arbitrary real-valued durations without first defining a meaningful integer unit.
Reference guidance and methodology.
Least Common Multiple Calculator questions.
What does the Least Common Multiple Calculator calculate?
Find the smallest positive multiple shared by a list of whole numbers using exact integer arithmetic.
Which formula or algorithm does it use?
lcm(a,b) = |a × b| ÷ gcd(a,b). The comma-, space-, or line-separated inputs are positive whole numbers; the result is the first positive integer divisible by each.
What limitations or edge cases matter?
Enter 2–100 positive whole numbers. Decimals, zeros, blank items, and values that make the result exceed the supported safe range are rejected. Convert intervals to the same whole-number unit before using LCM to compare when their cycles coincide. LCM applies to integers. It should not be used to synchronize arbitrary real-valued durations without first defining a meaningful integer unit.