Greatest Common Divisor (GCD) of 190 and 34
The greatest common divisor (GCD) of 190 and 34 is 2.
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 34?
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 ÷ 34 = 5 remainder 20 |
| 2 | 34 ÷ 20 = 1 remainder 14 |
| 3 | 20 ÷ 14 = 1 remainder 6 |
| 4 | 14 ÷ 6 = 2 remainder 2 |
| 5 | 6 ÷ 2 = 3 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 111 and 110 | 1 |
| 76 and 113 | 1 |
| 108 and 129 | 3 |
| 122 and 192 | 2 |
| 171 and 67 | 1 |