Greatest Common Divisor (GCD) of 111 and 80
The greatest common divisor (GCD) of 111 and 80 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 80?
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 ÷ 80 = 1 remainder 31 |
| 2 | 80 ÷ 31 = 2 remainder 18 |
| 3 | 31 ÷ 18 = 1 remainder 13 |
| 4 | 18 ÷ 13 = 1 remainder 5 |
| 5 | 13 ÷ 5 = 2 remainder 3 |
| 6 | 5 ÷ 3 = 1 remainder 2 |
| 7 | 3 ÷ 2 = 1 remainder 1 |
| 8 | 2 ÷ 1 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 127 and 192 | 1 |
| 106 and 83 | 1 |
| 162 and 168 | 6 |
| 55 and 132 | 11 |
| 165 and 69 | 3 |