Greatest Common Divisor (GCD) of 152 and 195
The greatest common divisor (GCD) of 152 and 195 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 152 and 195?
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 | 152 ÷ 195 = 0 remainder 152 |
| 2 | 195 ÷ 152 = 1 remainder 43 |
| 3 | 152 ÷ 43 = 3 remainder 23 |
| 4 | 43 ÷ 23 = 1 remainder 20 |
| 5 | 23 ÷ 20 = 1 remainder 3 |
| 6 | 20 ÷ 3 = 6 remainder 2 |
| 7 | 3 ÷ 2 = 1 remainder 1 |
| 8 | 2 ÷ 1 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 166 and 173 | 1 |
| 157 and 15 | 1 |
| 33 and 197 | 1 |
| 130 and 121 | 1 |
| 122 and 193 | 1 |