Greatest Common Divisor (GCD) of 160 and 97
The greatest common divisor (GCD) of 160 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 160 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 | 160 ÷ 97 = 1 remainder 63 |
| 2 | 97 ÷ 63 = 1 remainder 34 |
| 3 | 63 ÷ 34 = 1 remainder 29 |
| 4 | 34 ÷ 29 = 1 remainder 5 |
| 5 | 29 ÷ 5 = 5 remainder 4 |
| 6 | 5 ÷ 4 = 1 remainder 1 |
| 7 | 4 ÷ 1 = 4 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 31 and 30 | 1 |
| 10 and 103 | 1 |
| 12 and 90 | 6 |
| 19 and 61 | 1 |
| 71 and 102 | 1 |