Greatest Common Divisor (GCD) of 101 and 189
The greatest common divisor (GCD) of 101 and 189 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 189?
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 ÷ 189 = 0 remainder 101 |
| 2 | 189 ÷ 101 = 1 remainder 88 |
| 3 | 101 ÷ 88 = 1 remainder 13 |
| 4 | 88 ÷ 13 = 6 remainder 10 |
| 5 | 13 ÷ 10 = 1 remainder 3 |
| 6 | 10 ÷ 3 = 3 remainder 1 |
| 7 | 3 ÷ 1 = 3 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 130 and 64 | 2 |
| 35 and 170 | 5 |
| 119 and 126 | 7 |
| 72 and 197 | 1 |
| 118 and 140 | 2 |