Greatest Common Divisor (GCD) of 134 and 162
The greatest common divisor (GCD) of 134 and 162 is 2.
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 134 and 162?
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 | 134 ÷ 162 = 0 remainder 134 |
| 2 | 162 ÷ 134 = 1 remainder 28 |
| 3 | 134 ÷ 28 = 4 remainder 22 |
| 4 | 28 ÷ 22 = 1 remainder 6 |
| 5 | 22 ÷ 6 = 3 remainder 4 |
| 6 | 6 ÷ 4 = 1 remainder 2 |
| 7 | 4 ÷ 2 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 190 and 52 | 2 |
| 27 and 101 | 1 |
| 62 and 142 | 2 |
| 104 and 170 | 2 |
| 21 and 150 | 3 |