HowManyNumbers Logo

Greatest Common Divisor (GCD) of 108 and 196

The greatest common divisor (GCD) of 108 and 196 is 4.

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 108 and 196?

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 108 ÷ 196 = 0 remainder 108
2 196 ÷ 108 = 1 remainder 88
3 108 ÷ 88 = 1 remainder 20
4 88 ÷ 20 = 4 remainder 8
5 20 ÷ 8 = 2 remainder 4
6 8 ÷ 4 = 2 remainder 0

Examples of GCD Calculations

NumbersGCD
182 and 182182
19 and 961
49 and 1721
17 and 491
191 and 581

Try Calculating GCD of Other Numbers







Related Calculators