Greatest Common Divisor (GCD) of 131 and 181
The greatest common divisor (GCD) of 131 and 181 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 131 and 181?
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 | 131 ÷ 181 = 0 remainder 131 |
| 2 | 181 ÷ 131 = 1 remainder 50 |
| 3 | 131 ÷ 50 = 2 remainder 31 |
| 4 | 50 ÷ 31 = 1 remainder 19 |
| 5 | 31 ÷ 19 = 1 remainder 12 |
| 6 | 19 ÷ 12 = 1 remainder 7 |
| 7 | 12 ÷ 7 = 1 remainder 5 |
| 8 | 7 ÷ 5 = 1 remainder 2 |
| 9 | 5 ÷ 2 = 2 remainder 1 |
| 10 | 2 ÷ 1 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 153 and 170 | 17 |
| 156 and 164 | 4 |
| 150 and 151 | 1 |
| 163 and 185 | 1 |
| 199 and 107 | 1 |