Greatest Common Divisor (GCD) of 156 and 190
The greatest common divisor (GCD) of 156 and 190 is 2.
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 156 and 190?
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 | 156 ÷ 190 = 0 remainder 156 |
| 2 | 190 ÷ 156 = 1 remainder 34 |
| 3 | 156 ÷ 34 = 4 remainder 20 |
| 4 | 34 ÷ 20 = 1 remainder 14 |
| 5 | 20 ÷ 14 = 1 remainder 6 |
| 6 | 14 ÷ 6 = 2 remainder 2 |
| 7 | 6 ÷ 2 = 3 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 68 and 166 | 2 |
| 188 and 89 | 1 |
| 96 and 191 | 1 |
| 133 and 182 | 7 |
| 58 and 164 | 2 |