Greatest Common Divisor (GCD) of 60 and 2
The greatest common divisor (GCD) of 60 and 2 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 2?
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 ÷ 2 = 30 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 59 and 132 | 1 |
| 18 and 114 | 6 |
| 149 and 185 | 1 |
| 116 and 117 | 1 |
| 22 and 22 | 22 |