Greatest Common Divisor (GCD) of 166 and 30
The greatest common divisor (GCD) of 166 and 30 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 166 and 30?
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 ÷ 30 = 5 remainder 16 |
| 2 | 30 ÷ 16 = 1 remainder 14 |
| 3 | 16 ÷ 14 = 1 remainder 2 |
| 4 | 14 ÷ 2 = 7 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 130 and 38 | 2 |
| 115 and 142 | 1 |
| 170 and 153 | 17 |
| 197 and 21 | 1 |
| 54 and 87 | 3 |