Greatest Common Divisor (GCD) of 6 and 50

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

GCD(6,50)

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

Divisors of 6:
1, 2, 3, and 6.

Divisors of 50:
1, 2, 5, 10, 25, and 50.

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

GCD(6,50) = 2

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