HowManyNumbers Logo

Greatest Common Divisor (GCD) of 131 and 92

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

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 131 ÷ 92 = 1 remainder 39
2 92 ÷ 39 = 2 remainder 14
3 39 ÷ 14 = 2 remainder 11
4 14 ÷ 11 = 1 remainder 3
5 11 ÷ 3 = 3 remainder 2
6 3 ÷ 2 = 1 remainder 1
7 2 ÷ 1 = 2 remainder 0

Examples of GCD Calculations

NumbersGCD
38 and 1231
133 and 1081
130 and 1142
185 and 1531
43 and 1781

Try Calculating GCD of Other Numbers







Related Calculators