Greatest Common Divisor (GCD) of 82 and 130
The greatest common divisor (GCD) of 82 and 130 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 82 and 130?
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 | 82 ÷ 130 = 0 remainder 82 |
| 2 | 130 ÷ 82 = 1 remainder 48 |
| 3 | 82 ÷ 48 = 1 remainder 34 |
| 4 | 48 ÷ 34 = 1 remainder 14 |
| 5 | 34 ÷ 14 = 2 remainder 6 |
| 6 | 14 ÷ 6 = 2 remainder 2 |
| 7 | 6 ÷ 2 = 3 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 70 and 92 | 2 |
| 165 and 135 | 15 |
| 158 and 155 | 1 |
| 33 and 196 | 1 |
| 151 and 109 | 1 |