Greatest Common Divisor (GCD) of 146 and 136
The greatest common divisor (GCD) of 146 and 136 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 136?
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 ÷ 136 = 1 remainder 10 |
| 2 | 136 ÷ 10 = 13 remainder 6 |
| 3 | 10 ÷ 6 = 1 remainder 4 |
| 4 | 6 ÷ 4 = 1 remainder 2 |
| 5 | 4 ÷ 2 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 130 and 136 | 2 |
| 60 and 156 | 12 |
| 163 and 191 | 1 |
| 78 and 83 | 1 |
| 45 and 68 | 1 |