Greatest Common Divisor (GCD) of 107 and 189
The greatest common divisor (GCD) of 107 and 189 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 189?
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 ÷ 189 = 0 remainder 107 |
| 2 | 189 ÷ 107 = 1 remainder 82 |
| 3 | 107 ÷ 82 = 1 remainder 25 |
| 4 | 82 ÷ 25 = 3 remainder 7 |
| 5 | 25 ÷ 7 = 3 remainder 4 |
| 6 | 7 ÷ 4 = 1 remainder 3 |
| 7 | 4 ÷ 3 = 1 remainder 1 |
| 8 | 3 ÷ 1 = 3 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 166 and 44 | 2 |
| 179 and 155 | 1 |
| 180 and 16 | 4 |
| 19 and 169 | 1 |
| 81 and 20 | 1 |