What is GCD(37, 60)?

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

The GCD of 37 and 60 is 1.

How to compute GCD(37, 60)

Comparing the divisors of 37 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 37:

1, 37

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