Greatest Common Divisor (GCD) of 165 and 106
The greatest common divisor (GCD) of 165 and 106 is 1.
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 165 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 | 165 ÷ 106 = 1 remainder 59 |
| 2 | 106 ÷ 59 = 1 remainder 47 |
| 3 | 59 ÷ 47 = 1 remainder 12 |
| 4 | 47 ÷ 12 = 3 remainder 11 |
| 5 | 12 ÷ 11 = 1 remainder 1 |
| 6 | 11 ÷ 1 = 11 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 196 and 75 | 1 |
| 103 and 130 | 1 |
| 134 and 147 | 1 |
| 173 and 106 | 1 |
| 136 and 93 | 1 |