Greatest Common Divisor (GCD) of 140 and 53
The greatest common divisor (GCD) of 140 and 53 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 140 and 53?
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 | 140 ÷ 53 = 2 remainder 34 |
| 2 | 53 ÷ 34 = 1 remainder 19 |
| 3 | 34 ÷ 19 = 1 remainder 15 |
| 4 | 19 ÷ 15 = 1 remainder 4 |
| 5 | 15 ÷ 4 = 3 remainder 3 |
| 6 | 4 ÷ 3 = 1 remainder 1 |
| 7 | 3 ÷ 1 = 3 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 147 and 14 | 7 |
| 140 and 75 | 5 |
| 12 and 193 | 1 |
| 32 and 48 | 16 |
| 23 and 91 | 1 |