Greatest Common Divisor (GCD) of 110 and 196
The greatest common divisor (GCD) of 110 and 196 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 110 and 196?
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 | 110 ÷ 196 = 0 remainder 110 |
| 2 | 196 ÷ 110 = 1 remainder 86 |
| 3 | 110 ÷ 86 = 1 remainder 24 |
| 4 | 86 ÷ 24 = 3 remainder 14 |
| 5 | 24 ÷ 14 = 1 remainder 10 |
| 6 | 14 ÷ 10 = 1 remainder 4 |
| 7 | 10 ÷ 4 = 2 remainder 2 |
| 8 | 4 ÷ 2 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 51 and 70 | 1 |
| 64 and 66 | 2 |
| 167 and 15 | 1 |
| 104 and 44 | 4 |
| 151 and 46 | 1 |