Greatest Common Divisor (GCD) of 143 and 22
The greatest common divisor (GCD) of 143 and 22 is 11.
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 22?
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 ÷ 22 = 6 remainder 11 |
| 2 | 22 ÷ 11 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 200 and 159 | 1 |
| 190 and 175 | 5 |
| 35 and 63 | 7 |
| 150 and 62 | 2 |
| 192 and 122 | 2 |