Greatest Common Divisor (GCD) of 89 and 151
The greatest common divisor (GCD) of 89 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 89 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 | 89 ÷ 151 = 0 remainder 89 |
| 2 | 151 ÷ 89 = 1 remainder 62 |
| 3 | 89 ÷ 62 = 1 remainder 27 |
| 4 | 62 ÷ 27 = 2 remainder 8 |
| 5 | 27 ÷ 8 = 3 remainder 3 |
| 6 | 8 ÷ 3 = 2 remainder 2 |
| 7 | 3 ÷ 2 = 1 remainder 1 |
| 8 | 2 ÷ 1 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 176 and 23 | 1 |
| 160 and 64 | 32 |
| 100 and 65 | 5 |
| 36 and 104 | 4 |
| 157 and 33 | 1 |