Greatest Common Divisor (GCD) of 101 and 65
The greatest common divisor (GCD) of 101 and 65 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 101 and 65?
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 | 101 ÷ 65 = 1 remainder 36 |
| 2 | 65 ÷ 36 = 1 remainder 29 |
| 3 | 36 ÷ 29 = 1 remainder 7 |
| 4 | 29 ÷ 7 = 4 remainder 1 |
| 5 | 7 ÷ 1 = 7 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 165 and 14 | 1 |
| 194 and 191 | 1 |
| 148 and 47 | 1 |
| 200 and 198 | 2 |
| 184 and 25 | 1 |