GCD & LCM Calculator
Find the Greatest Common Divisor (GCD) and Least Common Multiple (LCM) of two or more numbers.
Parsed: 12, 18, 24
GCD (Greatest Common Divisor)
6
LCM (Least Common Multiple)
72
Formulas
GCD via Euclidean Algorithm: gcd(a, b) = gcd(b, a mod b), until b = 0
LCM(a, b) = |a x b| / GCD(a, b)
GCD is the largest number that divides all given numbers. LCM is the smallest number that is a multiple of all given numbers.
Related Tools
Results are for informational purposes only. Verify important calculations independently.