Greatest Common Divisor (GCD) of 139 and 177
The greatest common divisor (GCD) of 139 and 177 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 139 and 177?
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 | 139 ÷ 177 = 0 remainder 139 |
| 2 | 177 ÷ 139 = 1 remainder 38 |
| 3 | 139 ÷ 38 = 3 remainder 25 |
| 4 | 38 ÷ 25 = 1 remainder 13 |
| 5 | 25 ÷ 13 = 1 remainder 12 |
| 6 | 13 ÷ 12 = 1 remainder 1 |
| 7 | 12 ÷ 1 = 12 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 108 and 185 | 1 |
| 135 and 198 | 9 |
| 89 and 22 | 1 |
| 58 and 87 | 29 |
| 157 and 143 | 1 |