Greatest Common Divisor (GCD) of 60 and 143
The greatest common divisor (GCD) of 60 and 143 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 143?
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 ÷ 143 = 0 remainder 60 |
| 2 | 143 ÷ 60 = 2 remainder 23 |
| 3 | 60 ÷ 23 = 2 remainder 14 |
| 4 | 23 ÷ 14 = 1 remainder 9 |
| 5 | 14 ÷ 9 = 1 remainder 5 |
| 6 | 9 ÷ 5 = 1 remainder 4 |
| 7 | 5 ÷ 4 = 1 remainder 1 |
| 8 | 4 ÷ 1 = 4 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 192 and 63 | 3 |
| 61 and 72 | 1 |
| 188 and 174 | 2 |
| 13 and 25 | 1 |
| 108 and 76 | 4 |