Greatest Common Divisor (GCD) of 105 and 143
The greatest common divisor (GCD) of 105 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 105 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 | 105 ÷ 143 = 0 remainder 105 |
| 2 | 143 ÷ 105 = 1 remainder 38 |
| 3 | 105 ÷ 38 = 2 remainder 29 |
| 4 | 38 ÷ 29 = 1 remainder 9 |
| 5 | 29 ÷ 9 = 3 remainder 2 |
| 6 | 9 ÷ 2 = 4 remainder 1 |
| 7 | 2 ÷ 1 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 33 and 134 | 1 |
| 19 and 49 | 1 |
| 135 and 97 | 1 |
| 126 and 137 | 1 |
| 166 and 59 | 1 |