Greatest Common Divisor (GCD) of 157 and 188
The greatest common divisor (GCD) of 157 and 188 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 188?
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 ÷ 188 = 0 remainder 157 |
| 2 | 188 ÷ 157 = 1 remainder 31 |
| 3 | 157 ÷ 31 = 5 remainder 2 |
| 4 | 31 ÷ 2 = 15 remainder 1 |
| 5 | 2 ÷ 1 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 153 and 106 | 1 |
| 170 and 13 | 1 |
| 137 and 77 | 1 |
| 81 and 145 | 1 |
| 150 and 167 | 1 |