Greatest Common Divisor (GCD) of 60 and 151
The greatest common divisor (GCD) of 60 and 151 is 1.
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 151?
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 ÷ 151 = 0 remainder 60 |
| 2 | 151 ÷ 60 = 2 remainder 31 |
| 3 | 60 ÷ 31 = 1 remainder 29 |
| 4 | 31 ÷ 29 = 1 remainder 2 |
| 5 | 29 ÷ 2 = 14 remainder 1 |
| 6 | 2 ÷ 1 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 161 and 133 | 7 |
| 159 and 108 | 3 |
| 158 and 26 | 2 |
| 131 and 171 | 1 |
| 189 and 13 | 1 |