LCM(a,b)=|ab|/GCD(a,b)The GCD is the largest shared divisor; the LCM is the smallest positive shared multiple.
Find the greatest common divisor and least common multiple.
GCD & LCM — Find the greatest common divisor and least common multiple.
Useful for practice, understanding the method, and checking homework steps where outside tools are allowed.
Use the result for practice and understanding, not as a guaranteed answer. Verify important calculations and follow your school, university, and academic-integrity rules.
LCM(a,b)=|ab|/GCD(a,b)The GCD is the largest shared divisor; the LCM is the smallest positive shared multiple.
Use the starting values, then change one input to see its effect.After calculating, the tool shows the values used and the working so you can check it.