Greatest Common Divisor (GCD) of 120 and 175
The greatest common divisor (GCD) of 120 and 175 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 120 and 175?
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 | 120 ÷ 175 = 0 remainder 120 |
| 2 | 175 ÷ 120 = 1 remainder 55 |
| 3 | 120 ÷ 55 = 2 remainder 10 |
| 4 | 55 ÷ 10 = 5 remainder 5 |
| 5 | 10 ÷ 5 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 108 and 111 | 3 |
| 37 and 186 | 1 |
| 134 and 36 | 2 |
| 139 and 168 | 1 |
| 191 and 86 | 1 |