Greatest Common Divisor (GCD) of 116 and 190
The greatest common divisor (GCD) of 116 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 116 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 | 116 ÷ 190 = 0 remainder 116 |
| 2 | 190 ÷ 116 = 1 remainder 74 |
| 3 | 116 ÷ 74 = 1 remainder 42 |
| 4 | 74 ÷ 42 = 1 remainder 32 |
| 5 | 42 ÷ 32 = 1 remainder 10 |
| 6 | 32 ÷ 10 = 3 remainder 2 |
| 7 | 10 ÷ 2 = 5 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 195 and 13 | 13 |
| 170 and 89 | 1 |
| 160 and 162 | 2 |
| 37 and 74 | 37 |
| 195 and 104 | 13 |