Greatest Common Divisor (GCD) of 49 and 131
The greatest common divisor (GCD) of 49 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 49 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 | 49 ÷ 131 = 0 remainder 49 |
| 2 | 131 ÷ 49 = 2 remainder 33 |
| 3 | 49 ÷ 33 = 1 remainder 16 |
| 4 | 33 ÷ 16 = 2 remainder 1 |
| 5 | 16 ÷ 1 = 16 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 108 and 111 | 3 |
| 180 and 158 | 2 |
| 149 and 44 | 1 |
| 152 and 57 | 19 |
| 163 and 111 | 1 |