Greatest Common Divisor (GCD) of 98 and 180
The greatest common divisor (GCD) of 98 and 180 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 98 and 180?
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 | 98 ÷ 180 = 0 remainder 98 |
| 2 | 180 ÷ 98 = 1 remainder 82 |
| 3 | 98 ÷ 82 = 1 remainder 16 |
| 4 | 82 ÷ 16 = 5 remainder 2 |
| 5 | 16 ÷ 2 = 8 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 197 and 193 | 1 |
| 183 and 193 | 1 |
| 134 and 106 | 2 |
| 191 and 194 | 1 |
| 182 and 10 | 2 |