Greatest Common Divisor (GCD) of 159 and 160
The greatest common divisor (GCD) of 159 and 160 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 159 and 160?
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 | 159 ÷ 160 = 0 remainder 159 |
| 2 | 160 ÷ 159 = 1 remainder 1 |
| 3 | 159 ÷ 1 = 159 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 113 and 80 | 1 |
| 194 and 14 | 2 |
| 85 and 123 | 1 |
| 139 and 200 | 1 |
| 160 and 56 | 8 |