Greatest Common Divisor (GCD) of 146 and 43
The greatest common divisor (GCD) of 146 and 43 is 1.
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 43?
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 ÷ 43 = 3 remainder 17 |
| 2 | 43 ÷ 17 = 2 remainder 9 |
| 3 | 17 ÷ 9 = 1 remainder 8 |
| 4 | 9 ÷ 8 = 1 remainder 1 |
| 5 | 8 ÷ 1 = 8 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 195 and 117 | 39 |
| 199 and 77 | 1 |
| 48 and 194 | 2 |
| 124 and 89 | 1 |
| 152 and 164 | 4 |