Greatest Common Divisor (GCD) of 153 and 190
The greatest common divisor (GCD) of 153 and 190 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 153 and 190?
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 | 153 ÷ 190 = 0 remainder 153 |
| 2 | 190 ÷ 153 = 1 remainder 37 |
| 3 | 153 ÷ 37 = 4 remainder 5 |
| 4 | 37 ÷ 5 = 7 remainder 2 |
| 5 | 5 ÷ 2 = 2 remainder 1 |
| 6 | 2 ÷ 1 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 78 and 124 | 2 |
| 147 and 155 | 1 |
| 165 and 165 | 165 |
| 66 and 35 | 1 |
| 180 and 95 | 5 |