Greatest Common Divisor (GCD) of 102 and 140
The greatest common divisor (GCD) of 102 and 140 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 102 and 140?
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 | 102 ÷ 140 = 0 remainder 102 |
| 2 | 140 ÷ 102 = 1 remainder 38 |
| 3 | 102 ÷ 38 = 2 remainder 26 |
| 4 | 38 ÷ 26 = 1 remainder 12 |
| 5 | 26 ÷ 12 = 2 remainder 2 |
| 6 | 12 ÷ 2 = 6 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 190 and 141 | 1 |
| 128 and 85 | 1 |
| 94 and 110 | 2 |
| 146 and 62 | 2 |
| 144 and 15 | 3 |