Greatest Common Divisor (GCD) of 160 and 106
The greatest common divisor (GCD) of 160 and 106 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 106?
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 ÷ 106 = 1 remainder 54 |
| 2 | 106 ÷ 54 = 1 remainder 52 |
| 3 | 54 ÷ 52 = 1 remainder 2 |
| 4 | 52 ÷ 2 = 26 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 180 and 62 | 2 |
| 135 and 101 | 1 |
| 182 and 75 | 1 |
| 30 and 81 | 3 |
| 151 and 184 | 1 |