Greatest Common Divisor (GCD) of 141 and 120
The greatest common divisor (GCD) of 141 and 120 is 3.
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 141 and 120?
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 | 141 ÷ 120 = 1 remainder 21 |
| 2 | 120 ÷ 21 = 5 remainder 15 |
| 3 | 21 ÷ 15 = 1 remainder 6 |
| 4 | 15 ÷ 6 = 2 remainder 3 |
| 5 | 6 ÷ 3 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 173 and 184 | 1 |
| 27 and 59 | 1 |
| 17 and 105 | 1 |
| 157 and 192 | 1 |
| 112 and 79 | 1 |