Calculates the greatest common divisor and least common multiple.
The GCD/LCM calculator finds the greatest common divisor (largest number that divides both inputs exactly) and the least common multiple (smallest number divisible by both inputs).
GCD by Euclidean algorithm: GCD(a, b) = GCD(b, a mod b) until remainder = 0 LCM(a, b) = (a × b) / GCD(a, b)
GCD(48, 36): 48 mod 36 = 12; 36 mod 12 = 0 → GCD = 12. LCM = (48 × 36) / 12 = 1728 / 12 = 144.
Loading calculator…