Greatest Common Divisor (GCD) of 106 and 186
The greatest common divisor (GCD) of 106 and 186 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 106 and 186?
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 | 106 ÷ 186 = 0 remainder 106 |
| 2 | 186 ÷ 106 = 1 remainder 80 |
| 3 | 106 ÷ 80 = 1 remainder 26 |
| 4 | 80 ÷ 26 = 3 remainder 2 |
| 5 | 26 ÷ 2 = 13 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 154 and 138 | 2 |
| 101 and 20 | 1 |
| 108 and 53 | 1 |
| 26 and 113 | 1 |
| 154 and 184 | 2 |