Greatest Common Divisor (GCD) of 143 and 196
The greatest common divisor (GCD) of 143 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 143 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 | 143 ÷ 196 = 0 remainder 143 |
| 2 | 196 ÷ 143 = 1 remainder 53 |
| 3 | 143 ÷ 53 = 2 remainder 37 |
| 4 | 53 ÷ 37 = 1 remainder 16 |
| 5 | 37 ÷ 16 = 2 remainder 5 |
| 6 | 16 ÷ 5 = 3 remainder 1 |
| 7 | 5 ÷ 1 = 5 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 183 and 91 | 1 |
| 72 and 200 | 8 |
| 141 and 111 | 3 |
| 31 and 43 | 1 |
| 123 and 153 | 3 |