Greatest Common Divisor (GCD) of 158 and 97
The greatest common divisor (GCD) of 158 and 97 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 158 and 97?
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 | 158 ÷ 97 = 1 remainder 61 |
| 2 | 97 ÷ 61 = 1 remainder 36 |
| 3 | 61 ÷ 36 = 1 remainder 25 |
| 4 | 36 ÷ 25 = 1 remainder 11 |
| 5 | 25 ÷ 11 = 2 remainder 3 |
| 6 | 11 ÷ 3 = 3 remainder 2 |
| 7 | 3 ÷ 2 = 1 remainder 1 |
| 8 | 2 ÷ 1 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 189 and 18 | 9 |
| 118 and 136 | 2 |
| 49 and 60 | 1 |
| 64 and 185 | 1 |
| 171 and 91 | 1 |