Greatest Common Divisor (GCD) of 101 and 163
The greatest common divisor (GCD) of 101 and 163 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 101 and 163?
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 | 101 ÷ 163 = 0 remainder 101 |
| 2 | 163 ÷ 101 = 1 remainder 62 |
| 3 | 101 ÷ 62 = 1 remainder 39 |
| 4 | 62 ÷ 39 = 1 remainder 23 |
| 5 | 39 ÷ 23 = 1 remainder 16 |
| 6 | 23 ÷ 16 = 1 remainder 7 |
| 7 | 16 ÷ 7 = 2 remainder 2 |
| 8 | 7 ÷ 2 = 3 remainder 1 |
| 9 | 2 ÷ 1 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 145 and 12 | 1 |
| 152 and 134 | 2 |
| 50 and 167 | 1 |
| 19 and 150 | 1 |
| 196 and 189 | 7 |