Greatest Common Divisor (GCD) of 60 and 142
The greatest common divisor (GCD) of 60 and 142 is 2.
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 142?
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 ÷ 142 = 0 remainder 60 |
| 2 | 142 ÷ 60 = 2 remainder 22 |
| 3 | 60 ÷ 22 = 2 remainder 16 |
| 4 | 22 ÷ 16 = 1 remainder 6 |
| 5 | 16 ÷ 6 = 2 remainder 4 |
| 6 | 6 ÷ 4 = 1 remainder 2 |
| 7 | 4 ÷ 2 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 166 and 58 | 2 |
| 174 and 114 | 6 |
| 173 and 179 | 1 |
| 49 and 125 | 1 |
| 85 and 18 | 1 |