What is GCD(9, 60)?

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 60 is 3.

How to compute GCD(9, 60)

Comparing the divisors of 9 and 60

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 60:

1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60

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

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 60 by 9. The quotient is 6 and the remainder is 6.
  2. The previous divisor (9) is now the dividend. The remainder (6) is the new divisor. Divide 9 by 6. The quotient is 1 and the remainder is 3.
  3. The previous divisor (6) is now the dividend. The remainder (3) is the new divisor. Divide 6 by 3. The quotient is 2 and the remainder is 0.
  4. When you reach a remainder of 0, the last divisor (in this case, 3) is the GCD.