GCD Calculator - Greatest Common Divisor | HCF Calculator

Enter numbers (comma separated, max 10):

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

LCM: LCM(a, b) = |a × b| / GCD(a, b)

What is GCD?

The largest positive integer that divides each of the integers without a remainder.

Is GCD the same as HCF?

Yes, Greatest Common Divisor is the same as Highest Common Factor.

What is LCM?

Lowest Common Multiple.

Can GCD be negative?

By convention, GCD is always positive.

GCD Calculator (Greatest Common Divisor)