HowManyNumbers Logo

Greatest Common Divisor (GCD) of 71 and 189

The greatest common divisor (GCD) of 71 and 189 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 71 and 189?

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 71 ÷ 189 = 0 remainder 71
2 189 ÷ 71 = 2 remainder 47
3 71 ÷ 47 = 1 remainder 24
4 47 ÷ 24 = 1 remainder 23
5 24 ÷ 23 = 1 remainder 1
6 23 ÷ 1 = 23 remainder 0

Examples of GCD Calculations

NumbersGCD
139 and 721
115 and 1981
193 and 871
177 and 641
175 and 1991

Try Calculating GCD of Other Numbers







Related Calculators