Greatest Common Divisor (GCD) of 181 and 113
The greatest common divisor (GCD) of 181 and 113 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 181 and 113?
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 | 181 ÷ 113 = 1 remainder 68 |
| 2 | 113 ÷ 68 = 1 remainder 45 |
| 3 | 68 ÷ 45 = 1 remainder 23 |
| 4 | 45 ÷ 23 = 1 remainder 22 |
| 5 | 23 ÷ 22 = 1 remainder 1 |
| 6 | 22 ÷ 1 = 22 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 98 and 119 | 7 |
| 39 and 184 | 1 |
| 138 and 20 | 2 |
| 36 and 134 | 2 |
| 198 and 92 | 2 |