Greatest Common Divisor (GCD) of 135 and 196
The greatest common divisor (GCD) of 135 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 135 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 | 135 ÷ 196 = 0 remainder 135 |
| 2 | 196 ÷ 135 = 1 remainder 61 |
| 3 | 135 ÷ 61 = 2 remainder 13 |
| 4 | 61 ÷ 13 = 4 remainder 9 |
| 5 | 13 ÷ 9 = 1 remainder 4 |
| 6 | 9 ÷ 4 = 2 remainder 1 |
| 7 | 4 ÷ 1 = 4 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 103 and 181 | 1 |
| 55 and 55 | 55 |
| 27 and 140 | 1 |
| 187 and 137 | 1 |
| 17 and 160 | 1 |