Greatest Common Divisor (GCD) of 133 and 166
The greatest common divisor (GCD) of 133 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 133 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 | 133 ÷ 166 = 0 remainder 133 |
| 2 | 166 ÷ 133 = 1 remainder 33 |
| 3 | 133 ÷ 33 = 4 remainder 1 |
| 4 | 33 ÷ 1 = 33 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 180 and 51 | 3 |
| 93 and 21 | 3 |
| 161 and 26 | 1 |
| 195 and 45 | 15 |
| 143 and 65 | 13 |