Greatest Common Divisor (GCD) of 60 and 179
The greatest common divisor (GCD) of 60 and 179 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 179?
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 ÷ 179 = 0 remainder 60 |
| 2 | 179 ÷ 60 = 2 remainder 59 |
| 3 | 60 ÷ 59 = 1 remainder 1 |
| 4 | 59 ÷ 1 = 59 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 111 and 68 | 1 |
| 69 and 156 | 3 |
| 133 and 115 | 1 |
| 63 and 98 | 7 |
| 154 and 107 | 1 |