Greatest Common Divisor (GCD) of 113 and 82
The greatest common divisor (GCD) of 113 and 82 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 113 and 82?
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 | 113 ÷ 82 = 1 remainder 31 |
| 2 | 82 ÷ 31 = 2 remainder 20 |
| 3 | 31 ÷ 20 = 1 remainder 11 |
| 4 | 20 ÷ 11 = 1 remainder 9 |
| 5 | 11 ÷ 9 = 1 remainder 2 |
| 6 | 9 ÷ 2 = 4 remainder 1 |
| 7 | 2 ÷ 1 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 156 and 125 | 1 |
| 167 and 158 | 1 |
| 170 and 79 | 1 |
| 138 and 89 | 1 |
| 38 and 78 | 2 |