HowManyNumbers Logo

Greatest Common Divisor (GCD) of 111 and 96

The greatest common divisor (GCD) of 111 and 96 is 3.

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 111 and 96?

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 111 ÷ 96 = 1 remainder 15
2 96 ÷ 15 = 6 remainder 6
3 15 ÷ 6 = 2 remainder 3
4 6 ÷ 3 = 2 remainder 0

Examples of GCD Calculations

NumbersGCD
133 and 621
121 and 1331
82 and 4141
55 and 161
77 and 14311

Try Calculating GCD of Other Numbers







Related Calculators