Greatest Common Divisor (GCD) of 111 and 76
The greatest common divisor (GCD) of 111 and 76 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 76?
We use the Euclidean algorithm, which involves the following steps:
- Divide the larger number by the smaller number.
- Replace the larger number with the smaller number and the smaller number with the remainder from the division.
- Repeat this process until the remainder is zero.
- The non-zero remainder just before zero is the GCD.
Step-by-Step Euclidean Algorithm
| Step | Calculation |
|---|---|
| 1 | 111 ÷ 76 = 1 remainder 35 |
| 2 | 76 ÷ 35 = 2 remainder 6 |
| 3 | 35 ÷ 6 = 5 remainder 5 |
| 4 | 6 ÷ 5 = 1 remainder 1 |
| 5 | 5 ÷ 1 = 5 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 141 and 88 | 1 |
| 140 and 26 | 2 |
| 121 and 189 | 1 |
| 111 and 46 | 1 |
| 200 and 144 | 8 |