Greatest Common Divisor (GCD) of 146 and 64
The greatest common divisor (GCD) of 146 and 64 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 146 and 64?
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 | 146 ÷ 64 = 2 remainder 18 |
| 2 | 64 ÷ 18 = 3 remainder 10 |
| 3 | 18 ÷ 10 = 1 remainder 8 |
| 4 | 10 ÷ 8 = 1 remainder 2 |
| 5 | 8 ÷ 2 = 4 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 134 and 179 | 1 |
| 130 and 13 | 13 |
| 125 and 89 | 1 |
| 144 and 67 | 1 |
| 115 and 49 | 1 |