Greatest Common Divisor (GCD) of 157 and 108
The greatest common divisor (GCD) of 157 and 108 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 108?
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 ÷ 108 = 1 remainder 49 |
| 2 | 108 ÷ 49 = 2 remainder 10 |
| 3 | 49 ÷ 10 = 4 remainder 9 |
| 4 | 10 ÷ 9 = 1 remainder 1 |
| 5 | 9 ÷ 1 = 9 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 104 and 189 | 1 |
| 24 and 185 | 1 |
| 160 and 116 | 4 |
| 26 and 190 | 2 |
| 109 and 161 | 1 |