Greatest Common Divisor (GCD) of 162 and 120
The greatest common divisor (GCD) of 162 and 120 is 6.
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 162 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 | 162 ÷ 120 = 1 remainder 42 |
| 2 | 120 ÷ 42 = 2 remainder 36 |
| 3 | 42 ÷ 36 = 1 remainder 6 |
| 4 | 36 ÷ 6 = 6 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 164 and 150 | 2 |
| 168 and 99 | 3 |
| 50 and 169 | 1 |
| 70 and 126 | 14 |
| 185 and 197 | 1 |