Greatest Common Divisor (GCD) of 160 and 66
The greatest common divisor (GCD) of 160 and 66 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 66?
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 ÷ 66 = 2 remainder 28 |
| 2 | 66 ÷ 28 = 2 remainder 10 |
| 3 | 28 ÷ 10 = 2 remainder 8 |
| 4 | 10 ÷ 8 = 1 remainder 2 |
| 5 | 8 ÷ 2 = 4 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 37 and 12 | 1 |
| 169 and 66 | 1 |
| 130 and 100 | 10 |
| 27 and 105 | 3 |
| 145 and 173 | 1 |