HowManyNumbers Logo

Greatest Common Divisor (GCD) of 142 and 12

The greatest common divisor (GCD) of 142 and 12 is 2.

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 142 and 12?

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 142 ÷ 12 = 11 remainder 10
2 12 ÷ 10 = 1 remainder 2
3 10 ÷ 2 = 5 remainder 0

Examples of GCD Calculations

NumbersGCD
149 and 241
183 and 1811
153 and 891
121 and 1201
109 and 971

Try Calculating GCD of Other Numbers







Related Calculators