Greatest Common Divisor (GCD) of 133 and 184
The greatest common divisor (GCD) of 133 and 184 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 184?
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 ÷ 184 = 0 remainder 133 |
| 2 | 184 ÷ 133 = 1 remainder 51 |
| 3 | 133 ÷ 51 = 2 remainder 31 |
| 4 | 51 ÷ 31 = 1 remainder 20 |
| 5 | 31 ÷ 20 = 1 remainder 11 |
| 6 | 20 ÷ 11 = 1 remainder 9 |
| 7 | 11 ÷ 9 = 1 remainder 2 |
| 8 | 9 ÷ 2 = 4 remainder 1 |
| 9 | 2 ÷ 1 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 22 and 171 | 1 |
| 158 and 189 | 1 |
| 176 and 117 | 1 |
| 138 and 165 | 3 |
| 109 and 196 | 1 |