Greatest Common Divisor (GCD) of 101 and 140
The greatest common divisor (GCD) of 101 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 101 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 | 101 ÷ 140 = 0 remainder 101 |
| 2 | 140 ÷ 101 = 1 remainder 39 |
| 3 | 101 ÷ 39 = 2 remainder 23 |
| 4 | 39 ÷ 23 = 1 remainder 16 |
| 5 | 23 ÷ 16 = 1 remainder 7 |
| 6 | 16 ÷ 7 = 2 remainder 2 |
| 7 | 7 ÷ 2 = 3 remainder 1 |
| 8 | 2 ÷ 1 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 50 and 54 | 2 |
| 145 and 39 | 1 |
| 117 and 147 | 3 |
| 74 and 146 | 2 |
| 150 and 53 | 1 |