Greatest Common Divisor (GCD) of 56 and 146
The greatest common divisor (GCD) of 56 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 56 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 | 56 ÷ 146 = 0 remainder 56 |
| 2 | 146 ÷ 56 = 2 remainder 34 |
| 3 | 56 ÷ 34 = 1 remainder 22 |
| 4 | 34 ÷ 22 = 1 remainder 12 |
| 5 | 22 ÷ 12 = 1 remainder 10 |
| 6 | 12 ÷ 10 = 1 remainder 2 |
| 7 | 10 ÷ 2 = 5 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 198 and 172 | 2 |
| 77 and 150 | 1 |
| 89 and 169 | 1 |
| 129 and 26 | 1 |
| 27 and 161 | 1 |