Greatest Common Divisor (GCD) of 60 and 84

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

GCD(60,84)

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

Divisors of 60:
1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, and 60.

Divisors of 84:
1, 2, 3, 4, 6, 7, 12, 14, 21, 28, 42, and 84.

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

GCD(60,84) = 12

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 60 and 85
Go here for the next set of numbers that we calculated the Greatest Common Divisor for.