Greatest Common Divisor (GCD) of 97 and 159
The greatest common divisor (GCD) of 97 and 159 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 97 and 159?
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 | 97 ÷ 159 = 0 remainder 97 |
| 2 | 159 ÷ 97 = 1 remainder 62 |
| 3 | 97 ÷ 62 = 1 remainder 35 |
| 4 | 62 ÷ 35 = 1 remainder 27 |
| 5 | 35 ÷ 27 = 1 remainder 8 |
| 6 | 27 ÷ 8 = 3 remainder 3 |
| 7 | 8 ÷ 3 = 2 remainder 2 |
| 8 | 3 ÷ 2 = 1 remainder 1 |
| 9 | 2 ÷ 1 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 164 and 96 | 4 |
| 23 and 164 | 1 |
| 185 and 72 | 1 |
| 119 and 197 | 1 |
| 146 and 121 | 1 |