Greatest Common Divisor (GCD) of 146 and 36
The greatest common divisor (GCD) of 146 and 36 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 146 and 36?
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 | 146 ÷ 36 = 4 remainder 2 |
| 2 | 36 ÷ 2 = 18 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 193 and 141 | 1 |
| 97 and 121 | 1 |
| 81 and 45 | 9 |
| 196 and 45 | 1 |
| 170 and 32 | 2 |