Greatest Common Divisor (GCD) of 163 and 196
The greatest common divisor (GCD) of 163 and 196 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 163 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 | 163 ÷ 196 = 0 remainder 163 |
| 2 | 196 ÷ 163 = 1 remainder 33 |
| 3 | 163 ÷ 33 = 4 remainder 31 |
| 4 | 33 ÷ 31 = 1 remainder 2 |
| 5 | 31 ÷ 2 = 15 remainder 1 |
| 6 | 2 ÷ 1 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 111 and 54 | 3 |
| 127 and 110 | 1 |
| 164 and 56 | 4 |
| 66 and 18 | 6 |
| 18 and 37 | 1 |