Summary
Find the least common multiple of two non-zero integers.
Calculation details
Uses the Euclidean algorithm for the GCD step. Calculations retain raw JavaScript number precision; display values are rounded to at most six decimal places.
Formula
LCM(a, b) = |a × b| / GCD(a, b).
Worked example
LCM Calculator example
LCM is 36.
How it works
Enter two non-zero integers. LCM is computed via |a×b|/GCD(a,b).
Frequently asked questions
How accurate is the LCM Calculator?
The calculation keeps raw numeric precision and rounds only the displayed result to at most six decimal places.
What should I do with an invalid result?
Check that every visible value is finite and that no required divisor is zero.