GCD and LCM Calculator
Find the greatest common divisor and least common multiple of two numbers.
Greatest Common Divisor (GCD)
6
Least Common Multiple (LCM)
36
Cómo funciona
Uses the Euclidean algorithm to find the GCD, then derives the LCM from GCD(a,b) × LCM(a,b) = a × b.
What if one number is zero?
The GCD of a number and zero is the other number; LCM is undefined (shown as 0) when either input is zero.