HowManyNumbers Logo

Greatest Common Divisor (GCD) of 111 and 143

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

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

Examples of GCD Calculations

NumbersGCD
124 and 844
135 and 8127
96 and 351
106 and 1522
150 and 8010

Try Calculating GCD of Other Numbers







Related Calculators