What is GCD(9, 32)?

The GCD (Greatest Common Divisor) is the largest number that can divide two (or more) numbers without leaving a remainder.

The GCD of 9 and 32 is 1.

How to compute GCD(9, 32)

Comparing the divisors of 9 and 32

This first method consists in listing the divisors of the two numbers and then identifying the largest one they have in common.

Divisors of 9:

1, 3, 9

Divisors of 32:

1, 2, 4, 8, 16, 32

We can see from these two lists that the greatest divisor they have in common is: 1

For small numbers, this can be done quickly. However, as numbers increase, the list of potential divisors grows longer, making this method cumbersome and less practical.

Euclid's algorithm

Fortunately, there's a much more efficient method: Euclid's algorithm. It's particularly well-suited to larger numbers. Here's how it works:

  1. Divide 32 by 9. The quotient is 3 and the remainder is 5.
  2. The previous divisor (9) is now the dividend. The remainder (5) is the new divisor. Divide 9 by 5. The quotient is 1 and the remainder is 4.
  3. The previous divisor (5) is now the dividend. The remainder (4) is the new divisor. Divide 5 by 4. The quotient is 1 and the remainder is 1.
  4. The previous divisor (4) is now the dividend. The remainder (1) is the new divisor. Divide 4 by 1. The quotient is 4 and the remainder is 0.
  5. When you reach a remainder of 0, the last divisor (in this case, 1) is the GCD.