Greatest Common Divisor (GCD) of 80 and 151
The greatest common divisor (GCD) of 80 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 80 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 | 80 ÷ 151 = 0 remainder 80 |
| 2 | 151 ÷ 80 = 1 remainder 71 |
| 3 | 80 ÷ 71 = 1 remainder 9 |
| 4 | 71 ÷ 9 = 7 remainder 8 |
| 5 | 9 ÷ 8 = 1 remainder 1 |
| 6 | 8 ÷ 1 = 8 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 149 and 24 | 1 |
| 71 and 55 | 1 |
| 94 and 121 | 1 |
| 139 and 146 | 1 |
| 168 and 98 | 14 |