Greatest Common Divisor (GCD) of 110 and 146
The greatest common divisor (GCD) of 110 and 146 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 110 and 146?
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 | 110 ÷ 146 = 0 remainder 110 |
| 2 | 146 ÷ 110 = 1 remainder 36 |
| 3 | 110 ÷ 36 = 3 remainder 2 |
| 4 | 36 ÷ 2 = 18 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 114 and 193 | 1 |
| 109 and 72 | 1 |
| 72 and 122 | 2 |
| 171 and 120 | 3 |
| 68 and 37 | 1 |