Greatest Common Divisor (GCD) of 127 and 108
The greatest common divisor (GCD) of 127 and 108 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 127 and 108?
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 | 127 ÷ 108 = 1 remainder 19 |
| 2 | 108 ÷ 19 = 5 remainder 13 |
| 3 | 19 ÷ 13 = 1 remainder 6 |
| 4 | 13 ÷ 6 = 2 remainder 1 |
| 5 | 6 ÷ 1 = 6 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 199 and 115 | 1 |
| 178 and 89 | 89 |
| 125 and 30 | 5 |
| 107 and 159 | 1 |
| 20 and 26 | 2 |