Greatest Common Divisor (GCD) of 160 and 126
The greatest common divisor (GCD) of 160 and 126 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 160 and 126?
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 | 160 ÷ 126 = 1 remainder 34 |
| 2 | 126 ÷ 34 = 3 remainder 24 |
| 3 | 34 ÷ 24 = 1 remainder 10 |
| 4 | 24 ÷ 10 = 2 remainder 4 |
| 5 | 10 ÷ 4 = 2 remainder 2 |
| 6 | 4 ÷ 2 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 69 and 148 | 1 |
| 87 and 192 | 3 |
| 194 and 64 | 2 |
| 143 and 163 | 1 |
| 152 and 122 | 2 |