Greatest Common Divisor (GCD) of 67 and 120
The greatest common divisor (GCD) of 67 and 120 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 67 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 | 67 ÷ 120 = 0 remainder 67 |
| 2 | 120 ÷ 67 = 1 remainder 53 |
| 3 | 67 ÷ 53 = 1 remainder 14 |
| 4 | 53 ÷ 14 = 3 remainder 11 |
| 5 | 14 ÷ 11 = 1 remainder 3 |
| 6 | 11 ÷ 3 = 3 remainder 2 |
| 7 | 3 ÷ 2 = 1 remainder 1 |
| 8 | 2 ÷ 1 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 191 and 117 | 1 |
| 58 and 48 | 2 |
| 180 and 81 | 9 |
| 97 and 181 | 1 |
| 97 and 108 | 1 |