Greatest Common Divisor (GCD) of 11 and 33

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

GCD(11,33)

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

Divisors of 11:
1 and 11.

Divisors of 33:
1, 3, 11, and 33.

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

GCD(11,33) = 11

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