Greatest Common Divisor (GCD) of 189 and 139
The greatest common divisor (GCD) of 189 and 139 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 189 and 139?
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 | 189 ÷ 139 = 1 remainder 50 |
| 2 | 139 ÷ 50 = 2 remainder 39 |
| 3 | 50 ÷ 39 = 1 remainder 11 |
| 4 | 39 ÷ 11 = 3 remainder 6 |
| 5 | 11 ÷ 6 = 1 remainder 5 |
| 6 | 6 ÷ 5 = 1 remainder 1 |
| 7 | 5 ÷ 1 = 5 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 130 and 11 | 1 |
| 136 and 145 | 1 |
| 138 and 50 | 2 |
| 194 and 88 | 2 |
| 61 and 41 | 1 |