Greatest Common Divisor (GCD) of 57 and 36

The Greatest Common Divisor (GCD) of 57 and 36 is the largest positive integer that divides both 57 and 36. Mathematically, the problem we are solving is:

GCD(57,36)

To solve the problem, we will list all the positive integers (divisors) that can be divided into 57 and 36. We will then compare the lists of divisors to find the greatest divisor they have in common.

Divisors of 57:
1, 3, 19, and 57.

Divisors of 36:
1, 2, 3, 4, 6, 9, 12, 18, and 36.

When we compare the lists of divisors above, we see that the largest number they have in common is 3. Thus, the Greatest Common Divisor (GCD) of 57 and 36 is:

GCD(57,36) = 3

Greatest Common Divisor Calculator
Please enter another two or three numbers below so we can calculate the Greatest Common Divisor (GCD) for you:

Greatest Common Divisor (GCD) of 57 and 37
Go here for the next set of numbers that we calculated the Greatest Common Divisor for.