What is GCD(60, 82)?

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

The GCD of 60 and 82 is 2.

How to compute GCD(60, 82)

Comparing the divisors of 60 and 82

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

Divisors of 60:

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

Divisors of 82:

1, 2, 41, 82

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

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