Greatest Common Divisor (GCD) of 108 and 146
The greatest common divisor (GCD) of 108 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 108 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 | 108 ÷ 146 = 0 remainder 108 |
| 2 | 146 ÷ 108 = 1 remainder 38 |
| 3 | 108 ÷ 38 = 2 remainder 32 |
| 4 | 38 ÷ 32 = 1 remainder 6 |
| 5 | 32 ÷ 6 = 5 remainder 2 |
| 6 | 6 ÷ 2 = 3 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 101 and 54 | 1 |
| 95 and 105 | 5 |
| 84 and 147 | 21 |
| 200 and 165 | 5 |
| 145 and 37 | 1 |