Greatest Common Divisor (GCD) of 130 and 78
The greatest common divisor (GCD) of 130 and 78 is 26.
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 78?
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 ÷ 78 = 1 remainder 52 |
| 2 | 78 ÷ 52 = 1 remainder 26 |
| 3 | 52 ÷ 26 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 113 and 20 | 1 |
| 189 and 124 | 1 |
| 184 and 128 | 8 |
| 165 and 69 | 3 |
| 77 and 37 | 1 |