Greatest Common Divisor (GCD) of 107 and 170
The greatest common divisor (GCD) of 107 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 107 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 | 107 ÷ 170 = 0 remainder 107 |
| 2 | 170 ÷ 107 = 1 remainder 63 |
| 3 | 107 ÷ 63 = 1 remainder 44 |
| 4 | 63 ÷ 44 = 1 remainder 19 |
| 5 | 44 ÷ 19 = 2 remainder 6 |
| 6 | 19 ÷ 6 = 3 remainder 1 |
| 7 | 6 ÷ 1 = 6 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 109 and 196 | 1 |
| 138 and 112 | 2 |
| 134 and 49 | 1 |
| 121 and 28 | 1 |
| 20 and 190 | 10 |