Greatest Common Divisor (GCD) of 60 and 156
The greatest common divisor (GCD) of 60 and 156 is 12.
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 156?
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 ÷ 156 = 0 remainder 60 |
| 2 | 156 ÷ 60 = 2 remainder 36 |
| 3 | 60 ÷ 36 = 1 remainder 24 |
| 4 | 36 ÷ 24 = 1 remainder 12 |
| 5 | 24 ÷ 12 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 127 and 86 | 1 |
| 39 and 137 | 1 |
| 87 and 75 | 3 |
| 153 and 110 | 1 |
| 111 and 61 | 1 |