Greatest Common Divisor (GCD) of 129 and 149
The greatest common divisor (GCD) of 129 and 149 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 129 and 149?
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 | 129 ÷ 149 = 0 remainder 129 |
| 2 | 149 ÷ 129 = 1 remainder 20 |
| 3 | 129 ÷ 20 = 6 remainder 9 |
| 4 | 20 ÷ 9 = 2 remainder 2 |
| 5 | 9 ÷ 2 = 4 remainder 1 |
| 6 | 2 ÷ 1 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 138 and 128 | 2 |
| 80 and 48 | 16 |
| 131 and 38 | 1 |
| 196 and 17 | 1 |
| 127 and 95 | 1 |