Greatest Common Divisor (GCD) of 196 and 195
The greatest common divisor (GCD) of 196 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 196 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 | 196 ÷ 195 = 1 remainder 1 |
| 2 | 195 ÷ 1 = 195 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 199 and 58 | 1 |
| 145 and 35 | 5 |
| 142 and 24 | 2 |
| 13 and 111 | 1 |
| 148 and 184 | 4 |