Greatest Common Divisor (GCD) of 91 and 117
The greatest common divisor (GCD) of 91 and 117 is 13.
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 91 and 117?
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 | 91 ÷ 117 = 0 remainder 91 |
| 2 | 117 ÷ 91 = 1 remainder 26 |
| 3 | 91 ÷ 26 = 3 remainder 13 |
| 4 | 26 ÷ 13 = 2 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 55 and 119 | 1 |
| 197 and 162 | 1 |
| 194 and 151 | 1 |
| 107 and 51 | 1 |
| 105 and 148 | 1 |