Greatest Common Divisor (GCD) of 101 and 175
The greatest common divisor (GCD) of 101 and 175 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 175?
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 ÷ 175 = 0 remainder 101 |
| 2 | 175 ÷ 101 = 1 remainder 74 |
| 3 | 101 ÷ 74 = 1 remainder 27 |
| 4 | 74 ÷ 27 = 2 remainder 20 |
| 5 | 27 ÷ 20 = 1 remainder 7 |
| 6 | 20 ÷ 7 = 2 remainder 6 |
| 7 | 7 ÷ 6 = 1 remainder 1 |
| 8 | 6 ÷ 1 = 6 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 89 and 104 | 1 |
| 176 and 20 | 4 |
| 122 and 193 | 1 |
| 181 and 147 | 1 |
| 28 and 58 | 2 |