Greatest Common Divisor (GCD) of 115 and 187
The greatest common divisor (GCD) of 115 and 187 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 115 and 187?
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 | 115 ÷ 187 = 0 remainder 115 |
| 2 | 187 ÷ 115 = 1 remainder 72 |
| 3 | 115 ÷ 72 = 1 remainder 43 |
| 4 | 72 ÷ 43 = 1 remainder 29 |
| 5 | 43 ÷ 29 = 1 remainder 14 |
| 6 | 29 ÷ 14 = 2 remainder 1 |
| 7 | 14 ÷ 1 = 14 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 190 and 125 | 5 |
| 176 and 140 | 4 |
| 31 and 54 | 1 |
| 38 and 110 | 2 |
| 192 and 10 | 2 |