Greatest Common Divisor (GCD) of 29 and 162
The greatest common divisor (GCD) of 29 and 162 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 29 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 | 29 ÷ 162 = 0 remainder 29 |
| 2 | 162 ÷ 29 = 5 remainder 17 |
| 3 | 29 ÷ 17 = 1 remainder 12 |
| 4 | 17 ÷ 12 = 1 remainder 5 |
| 5 | 12 ÷ 5 = 2 remainder 2 |
| 6 | 5 ÷ 2 = 2 remainder 1 |
| 7 | 2 ÷ 1 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 161 and 173 | 1 |
| 95 and 66 | 1 |
| 170 and 183 | 1 |
| 11 and 72 | 1 |
| 194 and 117 | 1 |