Greatest Common Divisor (GCD) of 187 and 131
The greatest common divisor (GCD) of 187 and 131 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 187 and 131?
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 | 187 ÷ 131 = 1 remainder 56 |
| 2 | 131 ÷ 56 = 2 remainder 19 |
| 3 | 56 ÷ 19 = 2 remainder 18 |
| 4 | 19 ÷ 18 = 1 remainder 1 |
| 5 | 18 ÷ 1 = 18 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 176 and 63 | 1 |
| 80 and 67 | 1 |
| 25 and 82 | 1 |
| 58 and 152 | 2 |
| 156 and 74 | 2 |