Greatest Common Divisor (GCD) of 130 and 166
The greatest common divisor (GCD) of 130 and 166 is 2.
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 130 and 166?
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 | 130 ÷ 166 = 0 remainder 130 |
| 2 | 166 ÷ 130 = 1 remainder 36 |
| 3 | 130 ÷ 36 = 3 remainder 22 |
| 4 | 36 ÷ 22 = 1 remainder 14 |
| 5 | 22 ÷ 14 = 1 remainder 8 |
| 6 | 14 ÷ 8 = 1 remainder 6 |
| 7 | 8 ÷ 6 = 1 remainder 2 |
| 8 | 6 ÷ 2 = 3 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 82 and 107 | 1 |
| 122 and 154 | 2 |
| 120 and 25 | 5 |
| 42 and 76 | 2 |
| 197 and 167 | 1 |