Greatest Common Divisor (GCD) of 129 and 176
The greatest common divisor (GCD) of 129 and 176 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 176?
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 ÷ 176 = 0 remainder 129 |
| 2 | 176 ÷ 129 = 1 remainder 47 |
| 3 | 129 ÷ 47 = 2 remainder 35 |
| 4 | 47 ÷ 35 = 1 remainder 12 |
| 5 | 35 ÷ 12 = 2 remainder 11 |
| 6 | 12 ÷ 11 = 1 remainder 1 |
| 7 | 11 ÷ 1 = 11 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 110 and 166 | 2 |
| 58 and 50 | 2 |
| 73 and 163 | 1 |
| 102 and 95 | 1 |
| 168 and 43 | 1 |