Greatest Common Divisor (GCD) of 190 and 111
The greatest common divisor (GCD) of 190 and 111 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 190 and 111?
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 | 190 ÷ 111 = 1 remainder 79 |
| 2 | 111 ÷ 79 = 1 remainder 32 |
| 3 | 79 ÷ 32 = 2 remainder 15 |
| 4 | 32 ÷ 15 = 2 remainder 2 |
| 5 | 15 ÷ 2 = 7 remainder 1 |
| 6 | 2 ÷ 1 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 191 and 193 | 1 |
| 38 and 105 | 1 |
| 29 and 24 | 1 |
| 57 and 199 | 1 |
| 184 and 11 | 1 |