HowManyNumbers Logo

Greatest Common Divisor (GCD) of 29 and 78

The greatest common divisor (GCD) of 29 and 78 is 1.

What is the Greatest Common Divisor (GCD)?

The GCD of two integers is the largest positive integer that divides both numbers without leaving a remainder. It is useful in simplifying fractions, finding common factors, and in number theory.

How to Calculate the GCD of 29 and 78?

We use the Euclidean algorithm, which involves the following steps:

  1. Divide the larger number by the smaller number.
  2. Replace the larger number with the smaller number and the smaller number with the remainder from the division.
  3. Repeat this process until the remainder is zero.
  4. The non-zero remainder just before zero is the GCD.

Step-by-Step Euclidean Algorithm

StepCalculation
1 29 ÷ 78 = 0 remainder 29
2 78 ÷ 29 = 2 remainder 20
3 29 ÷ 20 = 1 remainder 9
4 20 ÷ 9 = 2 remainder 2
5 9 ÷ 2 = 4 remainder 1
6 2 ÷ 1 = 2 remainder 0

Examples of GCD Calculations

NumbersGCD
168 and 222
73 and 1581
15 and 12015
65 and 1241
163 and 1461

Try Calculating GCD of Other Numbers







Related Calculators