Greatest Common Divisor (GCD) of 66 and 105
The greatest common divisor (GCD) of 66 and 105 is 3.
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 66 and 105?
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 | 66 ÷ 105 = 0 remainder 66 |
| 2 | 105 ÷ 66 = 1 remainder 39 |
| 3 | 66 ÷ 39 = 1 remainder 27 |
| 4 | 39 ÷ 27 = 1 remainder 12 |
| 5 | 27 ÷ 12 = 2 remainder 3 |
| 6 | 12 ÷ 3 = 4 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 188 and 105 | 1 |
| 57 and 162 | 3 |
| 141 and 145 | 1 |
| 156 and 48 | 12 |
| 194 and 158 | 2 |