Greatest Common Divisor (GCD) of 136 and 98
The greatest common divisor (GCD) of 136 and 98 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 136 and 98?
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 | 136 ÷ 98 = 1 remainder 38 |
| 2 | 98 ÷ 38 = 2 remainder 22 |
| 3 | 38 ÷ 22 = 1 remainder 16 |
| 4 | 22 ÷ 16 = 1 remainder 6 |
| 5 | 16 ÷ 6 = 2 remainder 4 |
| 6 | 6 ÷ 4 = 1 remainder 2 |
| 7 | 4 ÷ 2 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 103 and 42 | 1 |
| 185 and 70 | 5 |
| 60 and 163 | 1 |
| 147 and 44 | 1 |
| 137 and 80 | 1 |