Greatest common divisor (GCD) calculator

Calculate the greatest common divisor of two or more integers using the Euclidean algorithm.

Processed on your device. Nothing is sent to any server.

Integers (comma separated)

GCD

6

Calculate the greatest common divisor (GCD) of two or more integers, the largest number that divides all of them with no remainder.

Uses the Euclidean algorithm, which computes the remainder of successive divisions until it reaches zero.

Use cases

Simplifying a fraction to its irreducible form.
Splitting items into equal groups of the largest possible size.
Solving school arithmetic problems.

How it works

1
Type the numbers
Enter two or more integers separated by commas or spaces.
2
Read the result
The GCD is calculated automatically.

Frequently asked questions

Does it work with more than two numbers?: Yes, it calculates the GCD of the whole list by applying the Euclidean algorithm pairwise cumulatively.

← Calculators