Greatest Common Divisor (GCD) of 64 and 145
The greatest common divisor (GCD) of 64 and 145 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 145?
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 ÷ 145 = 0 remainder 64 |
| 2 | 145 ÷ 64 = 2 remainder 17 |
| 3 | 64 ÷ 17 = 3 remainder 13 |
| 4 | 17 ÷ 13 = 1 remainder 4 |
| 5 | 13 ÷ 4 = 3 remainder 1 |
| 6 | 4 ÷ 1 = 4 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 30 and 63 | 3 |
| 86 and 72 | 2 |
| 156 and 84 | 12 |
| 146 and 145 | 1 |
| 161 and 46 | 23 |