Greatest Common Divisor (GCD) of 75 and 118
The greatest common divisor (GCD) of 75 and 118 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 75 and 118?
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 | 75 ÷ 118 = 0 remainder 75 |
| 2 | 118 ÷ 75 = 1 remainder 43 |
| 3 | 75 ÷ 43 = 1 remainder 32 |
| 4 | 43 ÷ 32 = 1 remainder 11 |
| 5 | 32 ÷ 11 = 2 remainder 10 |
| 6 | 11 ÷ 10 = 1 remainder 1 |
| 7 | 10 ÷ 1 = 10 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 142 and 26 | 2 |
| 178 and 79 | 1 |
| 124 and 75 | 1 |
| 197 and 152 | 1 |
| 121 and 69 | 1 |