Greatest Common Divisor (GCD) of 60 and 158
The greatest common divisor (GCD) of 60 and 158 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 158?
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 ÷ 158 = 0 remainder 60 |
| 2 | 158 ÷ 60 = 2 remainder 38 |
| 3 | 60 ÷ 38 = 1 remainder 22 |
| 4 | 38 ÷ 22 = 1 remainder 16 |
| 5 | 22 ÷ 16 = 1 remainder 6 |
| 6 | 16 ÷ 6 = 2 remainder 4 |
| 7 | 6 ÷ 4 = 1 remainder 2 |
| 8 | 4 ÷ 2 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 119 and 176 | 1 |
| 124 and 130 | 2 |
| 191 and 22 | 1 |
| 131 and 25 | 1 |
| 197 and 29 | 1 |