Greatest Common Divisor (GCD) of 164 and 181
The greatest common divisor (GCD) of 164 and 181 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 164 and 181?
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 | 164 ÷ 181 = 0 remainder 164 |
| 2 | 181 ÷ 164 = 1 remainder 17 |
| 3 | 164 ÷ 17 = 9 remainder 11 |
| 4 | 17 ÷ 11 = 1 remainder 6 |
| 5 | 11 ÷ 6 = 1 remainder 5 |
| 6 | 6 ÷ 5 = 1 remainder 1 |
| 7 | 5 ÷ 1 = 5 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 123 and 82 | 41 |
| 196 and 192 | 4 |
| 119 and 58 | 1 |
| 180 and 59 | 1 |
| 148 and 62 | 2 |