Greatest Common Divisor (GCD) of 98 and 147
The greatest common divisor (GCD) of 98 and 147 is 49.
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 147?
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 ÷ 147 = 0 remainder 98 |
| 2 | 147 ÷ 98 = 1 remainder 49 |
| 3 | 98 ÷ 49 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 130 and 121 | 1 |
| 59 and 65 | 1 |
| 154 and 137 | 1 |
| 95 and 159 | 1 |
| 115 and 125 | 5 |