Greatest Common Divisor (GCD) of 142 and 56
The greatest common divisor (GCD) of 142 and 56 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 142 and 56?
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 | 142 ÷ 56 = 2 remainder 30 |
| 2 | 56 ÷ 30 = 1 remainder 26 |
| 3 | 30 ÷ 26 = 1 remainder 4 |
| 4 | 26 ÷ 4 = 6 remainder 2 |
| 5 | 4 ÷ 2 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 175 and 81 | 1 |
| 101 and 174 | 1 |
| 105 and 119 | 7 |
| 10 and 95 | 5 |
| 199 and 166 | 1 |