Greatest Common Divisor (GCD) of 120 and 200
The greatest common divisor (GCD) of 120 and 200 is 40.
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 200?
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 ÷ 200 = 0 remainder 120 |
| 2 | 200 ÷ 120 = 1 remainder 80 |
| 3 | 120 ÷ 80 = 1 remainder 40 |
| 4 | 80 ÷ 40 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 138 and 156 | 6 |
| 32 and 112 | 16 |
| 108 and 119 | 1 |
| 157 and 13 | 1 |
| 156 and 60 | 12 |