Greatest Common Divisor (GCD) of 130 and 12
The greatest common divisor (GCD) of 130 and 12 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 12?
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 ÷ 12 = 10 remainder 10 |
| 2 | 12 ÷ 10 = 1 remainder 2 |
| 3 | 10 ÷ 2 = 5 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 152 and 25 | 1 |
| 102 and 85 | 17 |
| 157 and 61 | 1 |
| 158 and 28 | 2 |
| 152 and 138 | 2 |