Greatest Common Divisor (GCD) of 70 and 114
The greatest common divisor (GCD) of 70 and 114 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 70 and 114?
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 | 70 ÷ 114 = 0 remainder 70 |
| 2 | 114 ÷ 70 = 1 remainder 44 |
| 3 | 70 ÷ 44 = 1 remainder 26 |
| 4 | 44 ÷ 26 = 1 remainder 18 |
| 5 | 26 ÷ 18 = 1 remainder 8 |
| 6 | 18 ÷ 8 = 2 remainder 2 |
| 7 | 8 ÷ 2 = 4 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 155 and 180 | 5 |
| 66 and 51 | 3 |
| 12 and 77 | 1 |
| 132 and 132 | 132 |
| 148 and 27 | 1 |