Greatest Common Divisor (GCD) of 9 and 16

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

GCD(9,16)

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

Divisors of 9:
1, 3, and 9.

Divisors of 16:
1, 2, 4, 8, and 16.

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 9 and 16 is:

GCD(9,16) = 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 9 and 17
Go here for the next set of numbers that we calculated the Greatest Common Divisor for.