GCD & LCM Calculator
Find the Greatest Common Divisor and Least Common Multiple of multiple numbers
Enter Numbers
Results
Enter numbers and click Calculate
About GCD & LCM
Greatest Common Divisor (GCD)
Also known as the Greatest Common Factor (GCF) or Highest Common Factor (HCF). The Euclidean algorithm repeatedly divides the larger number by the smaller and takes the remainder until zero. The last non-zero remainder is the GCD.
Least Common Multiple (LCM)
The LCM of two numbers a and b is computed as LCM(a,b) = |a × b| / GCD(a,b). For multiple numbers, apply the formula iteratively: LCM(a,b,c) = LCM(LCM(a,b),c). Useful for adding fractions and solving scheduling problems.