Greatest Common Divisor (GCD) of 160 and 151
The greatest common divisor (GCD) of 160 and 151 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 151?
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 ÷ 151 = 1 remainder 9 |
| 2 | 151 ÷ 9 = 16 remainder 7 |
| 3 | 9 ÷ 7 = 1 remainder 2 |
| 4 | 7 ÷ 2 = 3 remainder 1 |
| 5 | 2 ÷ 1 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 29 and 191 | 1 |
| 171 and 99 | 9 |
| 11 and 114 | 1 |
| 111 and 186 | 3 |
| 91 and 105 | 7 |