GCD / LCM Calculator
Find the greatest common divisor and least common multiple of two or more integers.
Formula
GCD via Euclidean algorithm. LCM(a,b) = |ab| / GCD(a,b). GCF and HCF are the same as GCD.
Example
GCD(24, 36) = 12. LCM(24, 36) = 72.
FAQ
Is GCF the same as GCD?
Yes. Greatest common factor (GCF), highest common factor (HCF), and greatest common divisor (GCD) are the same idea.