Greatest Common Divisor (GCD) of 125 and 176
The greatest common divisor (GCD) of 125 and 176 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 125 and 176?
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 | 125 ÷ 176 = 0 remainder 125 |
| 2 | 176 ÷ 125 = 1 remainder 51 |
| 3 | 125 ÷ 51 = 2 remainder 23 |
| 4 | 51 ÷ 23 = 2 remainder 5 |
| 5 | 23 ÷ 5 = 4 remainder 3 |
| 6 | 5 ÷ 3 = 1 remainder 2 |
| 7 | 3 ÷ 2 = 1 remainder 1 |
| 8 | 2 ÷ 1 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 112 and 138 | 2 |
| 21 and 83 | 1 |
| 81 and 56 | 1 |
| 153 and 188 | 1 |
| 162 and 84 | 6 |