lcm of 4, 6, 15
- Numbers
- 4, 6, 15
Lowest common multiple60
independently verified by prime factorisation
Open this exampleLowest common multiple of a list of integers, computed through the GCD rather than by enumerating multiples.
Also called: lowest common multiple calculator, least common multiple.
The LCM is 60 and the GCD is 1.
The product of two numbers equals their GCD times their LCM, so dividing the product by the GCD gives the LCM directly. Enumerating multiples until one matches is the schoolbook method and is unusably slow on large numbers.
lcm = |a*b| / gcd(a,b)Each of these is asserted on every build. If a change to the engine ever moved one of these answers, the build would fail before the page could print it.
Lowest common multiple60
independently verified by prime factorisation
Open this exampleLowest common multiple20
boundary
Open this exampleLowest common multiple0
degenerate case
Open this example