Greatest Common Divisor (GCD) of 111 and 70
The greatest common divisor (GCD) of 111 and 70 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 111 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 | 111 ÷ 70 = 1 remainder 41 |
| 2 | 70 ÷ 41 = 1 remainder 29 |
| 3 | 41 ÷ 29 = 1 remainder 12 |
| 4 | 29 ÷ 12 = 2 remainder 5 |
| 5 | 12 ÷ 5 = 2 remainder 2 |
| 6 | 5 ÷ 2 = 2 remainder 1 |
| 7 | 2 ÷ 1 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 65 and 73 | 1 |
| 197 and 151 | 1 |
| 165 and 112 | 1 |
| 93 and 52 | 1 |
| 182 and 174 | 2 |