HowManyNumbers Logo

Greatest Common Divisor (GCD) of 106 and 112

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

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

Examples of GCD Calculations

NumbersGCD
80 and 155
115 and 355
35 and 1431
100 and 1564
23 and 1351

Try Calculating GCD of Other Numbers







Related Calculators