Greatest Common Divisor (GCD) of 57 and 145
The greatest common divisor (GCD) of 57 and 145 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 57 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 | 57 ÷ 145 = 0 remainder 57 |
| 2 | 145 ÷ 57 = 2 remainder 31 |
| 3 | 57 ÷ 31 = 1 remainder 26 |
| 4 | 31 ÷ 26 = 1 remainder 5 |
| 5 | 26 ÷ 5 = 5 remainder 1 |
| 6 | 5 ÷ 1 = 5 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 179 and 188 | 1 |
| 86 and 87 | 1 |
| 80 and 169 | 1 |
| 150 and 131 | 1 |
| 145 and 80 | 5 |