GCD/LCM Calculator

Find Greatest Common Divisor and Least Common Multiple

Numbers

Formula

GCD (Euclidean Algorithm): gcd(a, b) = gcd(b, a mod b) until b = 0, then a is the GCD.

LCM: lcm(a, b) = |a × b| / gcd(a, b)

For multiple numbers: GCD and LCM are applied iteratively.

Actions:

How to Use

What is GCD?

The Greatest Common Divisor is the largest number that divides all given numbers without a remainder.

What is LCM?

The Least Common Multiple is the smallest number that is a multiple of all given numbers.

Can I enter more than two numbers?

Yes. The tool supports GCD and LCM calculations for two or more numbers simultaneously.