1001Ferramentas
Calculators

GCD Calculator

Calculate the Greatest Common Divisor (GCD) of two or more numbers using the Euclidean algorithm. Instant result.

What is GCD?

The Greatest Common Divisor (GCD) is the largest number that exactly divides two or more integers. Calculated by the Euclidean algorithm: divide the larger by the smaller, then repeat with the divisor and remainder until the remainder is zero.

Example: GCD(12, 8) → 12 = 1×8 + 4 → 8 = 2×4 + 0 → GCD = 4.

Related Tools