Greatest Common Divisor (GCD) of 195 and 195
The greatest common divisor (GCD) of 195 and 195 is 195.
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 195 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 | 195 ÷ 195 = 1 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 112 and 141 | 1 |
| 182 and 54 | 2 |
| 148 and 176 | 4 |
| 137 and 96 | 1 |
| 195 and 67 | 1 |