Greatest Common Divisor (GCD) of 146 and 60
The greatest common divisor (GCD) of 146 and 60 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 146 and 60?
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 | 146 ÷ 60 = 2 remainder 26 |
| 2 | 60 ÷ 26 = 2 remainder 8 |
| 3 | 26 ÷ 8 = 3 remainder 2 |
| 4 | 8 ÷ 2 = 4 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 162 and 125 | 1 |
| 116 and 149 | 1 |
| 149 and 70 | 1 |
| 88 and 155 | 1 |
| 114 and 38 | 38 |