Greatest Common Divisor (GCD) of 83 and 198
The greatest common divisor (GCD) of 83 and 198 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 83 and 198?
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 | 83 ÷ 198 = 0 remainder 83 |
| 2 | 198 ÷ 83 = 2 remainder 32 |
| 3 | 83 ÷ 32 = 2 remainder 19 |
| 4 | 32 ÷ 19 = 1 remainder 13 |
| 5 | 19 ÷ 13 = 1 remainder 6 |
| 6 | 13 ÷ 6 = 2 remainder 1 |
| 7 | 6 ÷ 1 = 6 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 164 and 193 | 1 |
| 144 and 20 | 4 |
| 179 and 174 | 1 |
| 141 and 55 | 1 |
| 28 and 79 | 1 |