GCD and LCM Calculator
Find the greatest common divisor (GCF) and least common multiple of two whole numbers instantly.
About this tool
The GCD is found with the Euclidean algorithm (repeatedly replace the larger number by the remainder). The LCM then equals a x b / GCD. Use the GCD to simplify fractions and the LCM to find common denominators.
FAQ
What is the difference between GCD and LCM?
The GCD is the largest number dividing both inputs; the LCM is the smallest number both inputs divide.
Is GCD the same as GCF?
Yes, greatest common factor and greatest common divisor mean the same thing.
Worked example
For 48 and 180 the Euclidean algorithm gives: 180 = 3 x 48 + 36, 48 = 1 x 36 + 12, 36 = 3 x 12 + 0, so the GCD is 12. The LCM is 48 x 180 / 12 = 720. GCD is also called greatest common factor (GCF) or highest common factor (HCF).