Greatest Common Divisor (GCD) of 86 and 138
The greatest common divisor (GCD) of 86 and 138 is 2.
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 86 and 138?
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 | 86 ÷ 138 = 0 remainder 86 |
| 2 | 138 ÷ 86 = 1 remainder 52 |
| 3 | 86 ÷ 52 = 1 remainder 34 |
| 4 | 52 ÷ 34 = 1 remainder 18 |
| 5 | 34 ÷ 18 = 1 remainder 16 |
| 6 | 18 ÷ 16 = 1 remainder 2 |
| 7 | 16 ÷ 2 = 8 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 173 and 198 | 1 |
| 145 and 136 | 1 |
| 128 and 79 | 1 |
| 191 and 71 | 1 |
| 10 and 185 | 5 |