HowManyNumbers Logo

Greatest Common Divisor (GCD) of 46 and 142

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

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 46 ÷ 142 = 0 remainder 46
2 142 ÷ 46 = 3 remainder 4
3 46 ÷ 4 = 11 remainder 2
4 4 ÷ 2 = 2 remainder 0

Examples of GCD Calculations

NumbersGCD
110 and 1011
97 and 1091
90 and 18090
168 and 453
123 and 981

Try Calculating GCD of Other Numbers







Related Calculators