Greatest Common Divisor (GCD) of 60 and 120
The greatest common divisor (GCD) of 60 and 120 is 60.
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 120?
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 ÷ 120 = 0 remainder 60 |
| 2 | 120 ÷ 60 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 199 and 182 | 1 |
| 150 and 89 | 1 |
| 93 and 80 | 1 |
| 58 and 151 | 1 |
| 180 and 73 | 1 |