Greatest Common Divisor (GCD) of 141 and 196
The greatest common divisor (GCD) of 141 and 196 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 141 and 196?
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 ÷ 196 = 0 remainder 141 |
| 2 | 196 ÷ 141 = 1 remainder 55 |
| 3 | 141 ÷ 55 = 2 remainder 31 |
| 4 | 55 ÷ 31 = 1 remainder 24 |
| 5 | 31 ÷ 24 = 1 remainder 7 |
| 6 | 24 ÷ 7 = 3 remainder 3 |
| 7 | 7 ÷ 3 = 2 remainder 1 |
| 8 | 3 ÷ 1 = 3 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 90 and 28 | 2 |
| 12 and 39 | 3 |
| 145 and 27 | 1 |
| 146 and 52 | 2 |
| 181 and 153 | 1 |