Greatest Common Divisor (GCD) of 191 and 156
The greatest common divisor (GCD) of 191 and 156 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 191 and 156?
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 | 191 ÷ 156 = 1 remainder 35 |
| 2 | 156 ÷ 35 = 4 remainder 16 |
| 3 | 35 ÷ 16 = 2 remainder 3 |
| 4 | 16 ÷ 3 = 5 remainder 1 |
| 5 | 3 ÷ 1 = 3 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 167 and 101 | 1 |
| 199 and 161 | 1 |
| 165 and 130 | 5 |
| 110 and 191 | 1 |
| 75 and 30 | 15 |