Greatest Common Divisor (GCD) of 135 and 186
The greatest common divisor (GCD) of 135 and 186 is 3.
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 186?
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 ÷ 186 = 0 remainder 135 |
| 2 | 186 ÷ 135 = 1 remainder 51 |
| 3 | 135 ÷ 51 = 2 remainder 33 |
| 4 | 51 ÷ 33 = 1 remainder 18 |
| 5 | 33 ÷ 18 = 1 remainder 15 |
| 6 | 18 ÷ 15 = 1 remainder 3 |
| 7 | 15 ÷ 3 = 5 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 178 and 188 | 2 |
| 32 and 153 | 1 |
| 195 and 41 | 1 |
| 23 and 31 | 1 |
| 17 and 142 | 1 |