Greatest Common Divisor (GCD) of 185 and 106
The greatest common divisor (GCD) of 185 and 106 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 185 and 106?
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 | 185 ÷ 106 = 1 remainder 79 |
| 2 | 106 ÷ 79 = 1 remainder 27 |
| 3 | 79 ÷ 27 = 2 remainder 25 |
| 4 | 27 ÷ 25 = 1 remainder 2 |
| 5 | 25 ÷ 2 = 12 remainder 1 |
| 6 | 2 ÷ 1 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 21 and 21 | 21 |
| 158 and 120 | 2 |
| 129 and 168 | 3 |
| 102 and 92 | 2 |
| 170 and 115 | 5 |