Greatest Common Divisor (GCD) of 94 and 106
The greatest common divisor (GCD) of 94 and 106 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 94 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 | 94 ÷ 106 = 0 remainder 94 |
| 2 | 106 ÷ 94 = 1 remainder 12 |
| 3 | 94 ÷ 12 = 7 remainder 10 |
| 4 | 12 ÷ 10 = 1 remainder 2 |
| 5 | 10 ÷ 2 = 5 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 10 and 114 | 2 |
| 168 and 78 | 6 |
| 174 and 172 | 2 |
| 194 and 192 | 2 |
| 85 and 41 | 1 |