Greatest Common Divisor (GCD) of 86 and 137
The greatest common divisor (GCD) of 86 and 137 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 86 and 137?
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 ÷ 137 = 0 remainder 86 |
| 2 | 137 ÷ 86 = 1 remainder 51 |
| 3 | 86 ÷ 51 = 1 remainder 35 |
| 4 | 51 ÷ 35 = 1 remainder 16 |
| 5 | 35 ÷ 16 = 2 remainder 3 |
| 6 | 16 ÷ 3 = 5 remainder 1 |
| 7 | 3 ÷ 1 = 3 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 198 and 93 | 3 |
| 135 and 150 | 15 |
| 92 and 83 | 1 |
| 112 and 63 | 7 |
| 147 and 48 | 3 |