Greatest Common Divisor (GCD) of 160 and 62
The greatest common divisor (GCD) of 160 and 62 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 62?
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 ÷ 62 = 2 remainder 36 |
| 2 | 62 ÷ 36 = 1 remainder 26 |
| 3 | 36 ÷ 26 = 1 remainder 10 |
| 4 | 26 ÷ 10 = 2 remainder 6 |
| 5 | 10 ÷ 6 = 1 remainder 4 |
| 6 | 6 ÷ 4 = 1 remainder 2 |
| 7 | 4 ÷ 2 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 68 and 76 | 4 |
| 196 and 37 | 1 |
| 133 and 64 | 1 |
| 139 and 163 | 1 |
| 17 and 149 | 1 |