Greatest Common Divisor (GCD) of 60 and 145
The greatest common divisor (GCD) of 60 and 145 is 5.
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 145?
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 ÷ 145 = 0 remainder 60 |
| 2 | 145 ÷ 60 = 2 remainder 25 |
| 3 | 60 ÷ 25 = 2 remainder 10 |
| 4 | 25 ÷ 10 = 2 remainder 5 |
| 5 | 10 ÷ 5 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 181 and 162 | 1 |
| 24 and 166 | 2 |
| 101 and 28 | 1 |
| 17 and 26 | 1 |
| 106 and 170 | 2 |