Greatest Common Divisor (GCD) of 2 and 9

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

GCD(2,9)

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

Divisors of 2:
1 and 2.

Divisors of 9:
1, 3, and 9.

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

GCD(2,9) = 1

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