Greatest Common Divisor (GCD) of 115 and 166
The greatest common divisor (GCD) of 115 and 166 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 115 and 166?
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 | 115 ÷ 166 = 0 remainder 115 |
| 2 | 166 ÷ 115 = 1 remainder 51 |
| 3 | 115 ÷ 51 = 2 remainder 13 |
| 4 | 51 ÷ 13 = 3 remainder 12 |
| 5 | 13 ÷ 12 = 1 remainder 1 |
| 6 | 12 ÷ 1 = 12 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 197 and 88 | 1 |
| 132 and 118 | 2 |
| 151 and 95 | 1 |
| 64 and 142 | 2 |
| 146 and 81 | 1 |