Greatest Common Divisor (GCD) of 69 and 120
The greatest common divisor (GCD) of 69 and 120 is 3.
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 69 and 120?
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 | 69 ÷ 120 = 0 remainder 69 |
| 2 | 120 ÷ 69 = 1 remainder 51 |
| 3 | 69 ÷ 51 = 1 remainder 18 |
| 4 | 51 ÷ 18 = 2 remainder 15 |
| 5 | 18 ÷ 15 = 1 remainder 3 |
| 6 | 15 ÷ 3 = 5 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 154 and 185 | 1 |
| 176 and 95 | 1 |
| 110 and 100 | 10 |
| 139 and 75 | 1 |
| 134 and 65 | 1 |