Greatest Common Divisor (GCD) of 61 and 129
The greatest common divisor (GCD) of 61 and 129 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 61 and 129?
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 | 61 ÷ 129 = 0 remainder 61 |
| 2 | 129 ÷ 61 = 2 remainder 7 |
| 3 | 61 ÷ 7 = 8 remainder 5 |
| 4 | 7 ÷ 5 = 1 remainder 2 |
| 5 | 5 ÷ 2 = 2 remainder 1 |
| 6 | 2 ÷ 1 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 120 and 145 | 5 |
| 110 and 118 | 2 |
| 199 and 61 | 1 |
| 157 and 137 | 1 |
| 31 and 111 | 1 |