Greatest Common Divisor (GCD) of 140 and 36
The greatest common divisor (GCD) of 140 and 36 is 4.
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 36?
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 ÷ 36 = 3 remainder 32 |
| 2 | 36 ÷ 32 = 1 remainder 4 |
| 3 | 32 ÷ 4 = 8 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 100 and 28 | 4 |
| 179 and 29 | 1 |
| 121 and 24 | 1 |
| 62 and 47 | 1 |
| 159 and 106 | 53 |