Greatest Common Divisor (GCD) of 109 and 190
The greatest common divisor (GCD) of 109 and 190 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 109 and 190?
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 | 109 ÷ 190 = 0 remainder 109 |
| 2 | 190 ÷ 109 = 1 remainder 81 |
| 3 | 109 ÷ 81 = 1 remainder 28 |
| 4 | 81 ÷ 28 = 2 remainder 25 |
| 5 | 28 ÷ 25 = 1 remainder 3 |
| 6 | 25 ÷ 3 = 8 remainder 1 |
| 7 | 3 ÷ 1 = 3 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 119 and 136 | 17 |
| 90 and 116 | 2 |
| 65 and 192 | 1 |
| 159 and 91 | 1 |
| 102 and 122 | 2 |