Greatest Common Divisor (GCD) of 166 and 105
The greatest common divisor (GCD) of 166 and 105 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 166 and 105?
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 | 166 ÷ 105 = 1 remainder 61 |
| 2 | 105 ÷ 61 = 1 remainder 44 |
| 3 | 61 ÷ 44 = 1 remainder 17 |
| 4 | 44 ÷ 17 = 2 remainder 10 |
| 5 | 17 ÷ 10 = 1 remainder 7 |
| 6 | 10 ÷ 7 = 1 remainder 3 |
| 7 | 7 ÷ 3 = 2 remainder 1 |
| 8 | 3 ÷ 1 = 3 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 63 and 187 | 1 |
| 122 and 143 | 1 |
| 151 and 158 | 1 |
| 105 and 177 | 3 |
| 72 and 94 | 2 |