Greatest Common Divisor (GCD) of 196 and 118
The greatest common divisor (GCD) of 196 and 118 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 196 and 118?
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 | 196 ÷ 118 = 1 remainder 78 |
| 2 | 118 ÷ 78 = 1 remainder 40 |
| 3 | 78 ÷ 40 = 1 remainder 38 |
| 4 | 40 ÷ 38 = 1 remainder 2 |
| 5 | 38 ÷ 2 = 19 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 164 and 192 | 4 |
| 127 and 193 | 1 |
| 195 and 165 | 15 |
| 17 and 133 | 1 |
| 34 and 128 | 2 |