HowManyNumbers Logo

Greatest Common Divisor (GCD) of 117 and 185

The greatest common divisor (GCD) of 117 and 185 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 117 and 185?

We use the Euclidean algorithm, which involves the following steps:

  1. Divide the larger number by the smaller number.
  2. Replace the larger number with the smaller number and the smaller number with the remainder from the division.
  3. Repeat this process until the remainder is zero.
  4. The non-zero remainder just before zero is the GCD.

Step-by-Step Euclidean Algorithm

StepCalculation
1 117 ÷ 185 = 0 remainder 117
2 185 ÷ 117 = 1 remainder 68
3 117 ÷ 68 = 1 remainder 49
4 68 ÷ 49 = 1 remainder 19
5 49 ÷ 19 = 2 remainder 11
6 19 ÷ 11 = 1 remainder 8
7 11 ÷ 8 = 1 remainder 3
8 8 ÷ 3 = 2 remainder 2
9 3 ÷ 2 = 1 remainder 1
10 2 ÷ 1 = 2 remainder 0

Examples of GCD Calculations

NumbersGCD
39 and 1923
43 and 1371
116 and 5858
20 and 971
113 and 391

Try Calculating GCD of Other Numbers







Related Calculators