Greatest Common Divisor (GCD) of 143 and 58
The greatest common divisor (GCD) of 143 and 58 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 143 and 58?
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 | 143 ÷ 58 = 2 remainder 27 |
| 2 | 58 ÷ 27 = 2 remainder 4 |
| 3 | 27 ÷ 4 = 6 remainder 3 |
| 4 | 4 ÷ 3 = 1 remainder 1 |
| 5 | 3 ÷ 1 = 3 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 183 and 52 | 1 |
| 59 and 172 | 1 |
| 140 and 108 | 4 |
| 152 and 187 | 1 |
| 190 and 84 | 2 |