Greatest Common Divisor (GCD) of 109 and 140
The greatest common divisor (GCD) of 109 and 140 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 109 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 | 109 ÷ 140 = 0 remainder 109 |
| 2 | 140 ÷ 109 = 1 remainder 31 |
| 3 | 109 ÷ 31 = 3 remainder 16 |
| 4 | 31 ÷ 16 = 1 remainder 15 |
| 5 | 16 ÷ 15 = 1 remainder 1 |
| 6 | 15 ÷ 1 = 15 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 30 and 53 | 1 |
| 110 and 148 | 2 |
| 152 and 95 | 19 |
| 139 and 27 | 1 |
| 14 and 32 | 2 |