Greatest Common Divisor (GCD) of 106 and 62
The greatest common divisor (GCD) of 106 and 62 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 62?
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 ÷ 62 = 1 remainder 44 |
| 2 | 62 ÷ 44 = 1 remainder 18 |
| 3 | 44 ÷ 18 = 2 remainder 8 |
| 4 | 18 ÷ 8 = 2 remainder 2 |
| 5 | 8 ÷ 2 = 4 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 38 and 84 | 2 |
| 123 and 191 | 1 |
| 56 and 13 | 1 |
| 16 and 67 | 1 |
| 174 and 126 | 6 |