Greatest Common Divisor (GCD) of 66 and 40
The greatest common divisor (GCD) of 66 and 40 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 66 and 40?
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 ÷ 40 = 1 remainder 26 |
| 2 | 40 ÷ 26 = 1 remainder 14 |
| 3 | 26 ÷ 14 = 1 remainder 12 |
| 4 | 14 ÷ 12 = 1 remainder 2 |
| 5 | 12 ÷ 2 = 6 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 130 and 171 | 1 |
| 150 and 28 | 2 |
| 60 and 127 | 1 |
| 148 and 11 | 1 |
| 195 and 176 | 1 |