Greatest Common Divisor (GCD) of 141 and 189
The greatest common divisor (GCD) of 141 and 189 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 189?
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 ÷ 189 = 0 remainder 141 |
| 2 | 189 ÷ 141 = 1 remainder 48 |
| 3 | 141 ÷ 48 = 2 remainder 45 |
| 4 | 48 ÷ 45 = 1 remainder 3 |
| 5 | 45 ÷ 3 = 15 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 181 and 65 | 1 |
| 170 and 59 | 1 |
| 129 and 60 | 3 |
| 101 and 108 | 1 |
| 155 and 16 | 1 |