Greatest Common Divisor (GCD) of 42 and 147
The greatest common divisor (GCD) of 42 and 147 is 21.
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 42 and 147?
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 | 42 ÷ 147 = 0 remainder 42 |
| 2 | 147 ÷ 42 = 3 remainder 21 |
| 3 | 42 ÷ 21 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 68 and 33 | 1 |
| 164 and 94 | 2 |
| 76 and 130 | 2 |
| 66 and 67 | 1 |
| 18 and 165 | 3 |