Greatest Common Divisor (GCD) of 32 and 143
The greatest common divisor (GCD) of 32 and 143 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 32 and 143?
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 | 32 ÷ 143 = 0 remainder 32 |
| 2 | 143 ÷ 32 = 4 remainder 15 |
| 3 | 32 ÷ 15 = 2 remainder 2 |
| 4 | 15 ÷ 2 = 7 remainder 1 |
| 5 | 2 ÷ 1 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 10 and 198 | 2 |
| 171 and 139 | 1 |
| 125 and 30 | 5 |
| 159 and 57 | 3 |
| 52 and 79 | 1 |