Greatest Common Divisor (GCD) of 130 and 58
The greatest common divisor (GCD) of 130 and 58 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 58?
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 ÷ 58 = 2 remainder 14 |
| 2 | 58 ÷ 14 = 4 remainder 2 |
| 3 | 14 ÷ 2 = 7 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 126 and 20 | 2 |
| 36 and 124 | 4 |
| 14 and 146 | 2 |
| 185 and 176 | 1 |
| 131 and 17 | 1 |