Greatest Common Divisor (GCD) of 129 and 106
The greatest common divisor (GCD) of 129 and 106 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 106?
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 ÷ 106 = 1 remainder 23 |
| 2 | 106 ÷ 23 = 4 remainder 14 |
| 3 | 23 ÷ 14 = 1 remainder 9 |
| 4 | 14 ÷ 9 = 1 remainder 5 |
| 5 | 9 ÷ 5 = 1 remainder 4 |
| 6 | 5 ÷ 4 = 1 remainder 1 |
| 7 | 4 ÷ 1 = 4 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 101 and 111 | 1 |
| 129 and 13 | 1 |
| 190 and 65 | 5 |
| 171 and 77 | 1 |
| 126 and 145 | 1 |