Greatest Common Divisor (GCD) of 60 and 133
The greatest common divisor (GCD) of 60 and 133 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 60 and 133?
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 | 60 ÷ 133 = 0 remainder 60 |
| 2 | 133 ÷ 60 = 2 remainder 13 |
| 3 | 60 ÷ 13 = 4 remainder 8 |
| 4 | 13 ÷ 8 = 1 remainder 5 |
| 5 | 8 ÷ 5 = 1 remainder 3 |
| 6 | 5 ÷ 3 = 1 remainder 2 |
| 7 | 3 ÷ 2 = 1 remainder 1 |
| 8 | 2 ÷ 1 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 181 and 87 | 1 |
| 196 and 143 | 1 |
| 125 and 88 | 1 |
| 129 and 89 | 1 |
| 62 and 95 | 1 |