Greatest Common Divisor (GCD) of 114 and 70
The greatest common divisor (GCD) of 114 and 70 is 2.
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 114 and 70?
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 | 114 ÷ 70 = 1 remainder 44 |
| 2 | 70 ÷ 44 = 1 remainder 26 |
| 3 | 44 ÷ 26 = 1 remainder 18 |
| 4 | 26 ÷ 18 = 1 remainder 8 |
| 5 | 18 ÷ 8 = 2 remainder 2 |
| 6 | 8 ÷ 2 = 4 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 194 and 122 | 2 |
| 176 and 104 | 8 |
| 62 and 150 | 2 |
| 150 and 121 | 1 |
| 27 and 196 | 1 |