Greatest Common Divisor (GCD) of 64 and 39
The greatest common divisor (GCD) of 64 and 39 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 64 and 39?
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 | 64 ÷ 39 = 1 remainder 25 |
| 2 | 39 ÷ 25 = 1 remainder 14 |
| 3 | 25 ÷ 14 = 1 remainder 11 |
| 4 | 14 ÷ 11 = 1 remainder 3 |
| 5 | 11 ÷ 3 = 3 remainder 2 |
| 6 | 3 ÷ 2 = 1 remainder 1 |
| 7 | 2 ÷ 1 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 198 and 180 | 18 |
| 196 and 50 | 2 |
| 115 and 132 | 1 |
| 97 and 135 | 1 |
| 80 and 179 | 1 |