HowManyNumbers Logo

Greatest Common Divisor (GCD) of 142 and 119

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

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

Examples of GCD Calculations

NumbersGCD
102 and 633
95 and 1981
26 and 1842
25 and 305
96 and 8412

Try Calculating GCD of Other Numbers







Related Calculators