Greatest Common Divisor (GCD) of 64 and 150
The greatest common divisor (GCD) of 64 and 150 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 64 and 150?
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 ÷ 150 = 0 remainder 64 |
| 2 | 150 ÷ 64 = 2 remainder 22 |
| 3 | 64 ÷ 22 = 2 remainder 20 |
| 4 | 22 ÷ 20 = 1 remainder 2 |
| 5 | 20 ÷ 2 = 10 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 85 and 104 | 1 |
| 33 and 67 | 1 |
| 69 and 129 | 3 |
| 117 and 45 | 9 |
| 28 and 54 | 2 |