Greatest Common Divisor (GCD) of 59 and 170
The greatest common divisor (GCD) of 59 and 170 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 59 and 170?
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 | 59 ÷ 170 = 0 remainder 59 |
| 2 | 170 ÷ 59 = 2 remainder 52 |
| 3 | 59 ÷ 52 = 1 remainder 7 |
| 4 | 52 ÷ 7 = 7 remainder 3 |
| 5 | 7 ÷ 3 = 2 remainder 1 |
| 6 | 3 ÷ 1 = 3 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 155 and 119 | 1 |
| 161 and 107 | 1 |
| 147 and 159 | 3 |
| 152 and 200 | 8 |
| 177 and 184 | 1 |