Greatest Common Divisor (GCD) of 143 and 57
The greatest common divisor (GCD) of 143 and 57 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 57?
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 ÷ 57 = 2 remainder 29 |
| 2 | 57 ÷ 29 = 1 remainder 28 |
| 3 | 29 ÷ 28 = 1 remainder 1 |
| 4 | 28 ÷ 1 = 28 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 103 and 39 | 1 |
| 49 and 131 | 1 |
| 25 and 173 | 1 |
| 181 and 64 | 1 |
| 190 and 55 | 5 |