HowManyNumbers Logo

Greatest Common Divisor (GCD) of 143 and 179

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

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 143 ÷ 179 = 0 remainder 143
2 179 ÷ 143 = 1 remainder 36
3 143 ÷ 36 = 3 remainder 35
4 36 ÷ 35 = 1 remainder 1
5 35 ÷ 1 = 35 remainder 0

Examples of GCD Calculations

NumbersGCD
32 and 1404
17 and 581
131 and 171
126 and 191
94 and 1382

Try Calculating GCD of Other Numbers







Related Calculators