Greatest Common Divisor (GCD) of 65 and 160
The greatest common divisor (GCD) of 65 and 160 is 5.
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 65 and 160?
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 | 65 ÷ 160 = 0 remainder 65 |
| 2 | 160 ÷ 65 = 2 remainder 30 |
| 3 | 65 ÷ 30 = 2 remainder 5 |
| 4 | 30 ÷ 5 = 6 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 166 and 113 | 1 |
| 53 and 197 | 1 |
| 161 and 122 | 1 |
| 71 and 121 | 1 |
| 170 and 18 | 2 |