What is GCD(39, 63)?

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

The GCD of 39 and 63 is 3.

How to compute GCD(39, 63)

Comparing the divisors of 39 and 63

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

Divisors of 39:

1, 3, 13, 39

Divisors of 63:

1, 3, 7, 9, 21, 63

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