Greatest Common Divisor (GCD) of 135 and 163
The greatest common divisor (GCD) of 135 and 163 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 163?
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 ÷ 163 = 0 remainder 135 |
| 2 | 163 ÷ 135 = 1 remainder 28 |
| 3 | 135 ÷ 28 = 4 remainder 23 |
| 4 | 28 ÷ 23 = 1 remainder 5 |
| 5 | 23 ÷ 5 = 4 remainder 3 |
| 6 | 5 ÷ 3 = 1 remainder 2 |
| 7 | 3 ÷ 2 = 1 remainder 1 |
| 8 | 2 ÷ 1 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 96 and 139 | 1 |
| 120 and 184 | 8 |
| 78 and 39 | 39 |
| 104 and 189 | 1 |
| 158 and 98 | 2 |