Find the smallest number that is a multiple of both inputs.
Informational calculator only. Verify important outputs independently before legal, tax, medical, engineering, safety-critical, contractual, employment, or compliance use.
Enter job values, review the estimate, then use the decision hints before ordering or quoting.
First positive integer
Second positive integer
LCM(a, b) = |a × b| / GCD(a, b)Uses Euclidean algorithm to find GCD, then divides product by GCD. Efficient and exact.
For multiple numbers: LCM(a,b,c) = LCM(LCM(a,b), c)
Find the largest number that divides both inputs evenly.
Next: lcm of three numbers.
This tool works well for focused work where you only want one formula and one answer path around arithmetic common difference.
GCF(a,b) × LCM(a,b) = |a × b|. They are dual concepts.
Common denominator = LCM of denominators — makes addition/subtraction easy.