HowManyNumbers Logo

Greatest Common Divisor (GCD) of 143 and 126

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

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 ÷ 126 = 1 remainder 17
2 126 ÷ 17 = 7 remainder 7
3 17 ÷ 7 = 2 remainder 3
4 7 ÷ 3 = 2 remainder 1
5 3 ÷ 1 = 3 remainder 0

Examples of GCD Calculations

NumbersGCD
13 and 1761
71 and 1391
142 and 1571
32 and 1582
68 and 1791

Try Calculating GCD of Other Numbers







Related Calculators