Greatest Common Divisor (GCD) of 88 and 142
The greatest common divisor (GCD) of 88 and 142 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 88 and 142?
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 | 88 ÷ 142 = 0 remainder 88 |
| 2 | 142 ÷ 88 = 1 remainder 54 |
| 3 | 88 ÷ 54 = 1 remainder 34 |
| 4 | 54 ÷ 34 = 1 remainder 20 |
| 5 | 34 ÷ 20 = 1 remainder 14 |
| 6 | 20 ÷ 14 = 1 remainder 6 |
| 7 | 14 ÷ 6 = 2 remainder 2 |
| 8 | 6 ÷ 2 = 3 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 186 and 121 | 1 |
| 192 and 86 | 2 |
| 149 and 70 | 1 |
| 109 and 131 | 1 |
| 36 and 146 | 2 |