Least Common Multiple Calculator

Solve least common multiple problems instantly with our free Least Common Multiple Calculator. Accurate, step-by-step results — no sign-up required.

Loading calculator…

How the Least Common Multiple Calculator Is Calculated

Greatest common divisor is found with the Euclidean algorithm (repeatedly replacing the larger number with the remainder of dividing it by the smaller, until the remainder is 0) — the fastest standard method for computing a GCD. Least common multiple is then derived from GCD using LCM = |a × b| ÷ GCD.

About the Least Common Multiple Calculator

Solve least common multiple problems instantly with our free Least Common Multiple Calculator. Accurate, step-by-step results — no sign-up required.