Greatest Common Divisor (GCD) of 85 and 136
The greatest common divisor (GCD) of 85 and 136 is 17.
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 85 and 136?
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 | 85 ÷ 136 = 0 remainder 85 |
| 2 | 136 ÷ 85 = 1 remainder 51 |
| 3 | 85 ÷ 51 = 1 remainder 34 |
| 4 | 51 ÷ 34 = 1 remainder 17 |
| 5 | 34 ÷ 17 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 150 and 122 | 2 |
| 167 and 164 | 1 |
| 137 and 40 | 1 |
| 92 and 175 | 1 |
| 144 and 21 | 3 |