Greatest Common Divisor (GCD) of 115 and 69
The greatest common divisor (GCD) of 115 and 69 is 23.
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 115 and 69?
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 | 115 ÷ 69 = 1 remainder 46 |
| 2 | 69 ÷ 46 = 1 remainder 23 |
| 3 | 46 ÷ 23 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 101 and 91 | 1 |
| 62 and 186 | 62 |
| 190 and 166 | 2 |
| 64 and 54 | 2 |
| 182 and 85 | 1 |