Greatest Common Divisor (GCD) of 160 and 93
The greatest common divisor (GCD) of 160 and 93 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 160 and 93?
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 | 160 ÷ 93 = 1 remainder 67 |
| 2 | 93 ÷ 67 = 1 remainder 26 |
| 3 | 67 ÷ 26 = 2 remainder 15 |
| 4 | 26 ÷ 15 = 1 remainder 11 |
| 5 | 15 ÷ 11 = 1 remainder 4 |
| 6 | 11 ÷ 4 = 2 remainder 3 |
| 7 | 4 ÷ 3 = 1 remainder 1 |
| 8 | 3 ÷ 1 = 3 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 70 and 94 | 2 |
| 65 and 195 | 65 |
| 188 and 51 | 1 |
| 179 and 153 | 1 |
| 94 and 31 | 1 |