Greatest Common Divisor (GCD) of 157 and 158
The greatest common divisor (GCD) of 157 and 158 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 157 and 158?
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 | 157 ÷ 158 = 0 remainder 157 |
| 2 | 158 ÷ 157 = 1 remainder 1 |
| 3 | 157 ÷ 1 = 157 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 106 and 184 | 2 |
| 148 and 62 | 2 |
| 122 and 130 | 2 |
| 67 and 184 | 1 |
| 23 and 45 | 1 |