Greatest Common Divisor (GCD) of 176 and 105
The greatest common divisor (GCD) of 176 and 105 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 176 and 105?
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 | 176 ÷ 105 = 1 remainder 71 |
| 2 | 105 ÷ 71 = 1 remainder 34 |
| 3 | 71 ÷ 34 = 2 remainder 3 |
| 4 | 34 ÷ 3 = 11 remainder 1 |
| 5 | 3 ÷ 1 = 3 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 112 and 53 | 1 |
| 122 and 18 | 2 |
| 88 and 116 | 4 |
| 121 and 18 | 1 |
| 148 and 179 | 1 |