Greatest Common Divisor (GCD) of 135 and 188
The greatest common divisor (GCD) of 135 and 188 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 188?
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 ÷ 188 = 0 remainder 135 |
| 2 | 188 ÷ 135 = 1 remainder 53 |
| 3 | 135 ÷ 53 = 2 remainder 29 |
| 4 | 53 ÷ 29 = 1 remainder 24 |
| 5 | 29 ÷ 24 = 1 remainder 5 |
| 6 | 24 ÷ 5 = 4 remainder 4 |
| 7 | 5 ÷ 4 = 1 remainder 1 |
| 8 | 4 ÷ 1 = 4 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 33 and 82 | 1 |
| 108 and 38 | 2 |
| 60 and 200 | 20 |
| 156 and 36 | 12 |
| 35 and 80 | 5 |