HowManyNumbers Logo

Greatest Common Divisor (GCD) of 30 and 186

The greatest common divisor (GCD) of 30 and 186 is 6.

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 30 and 186?

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 30 ÷ 186 = 0 remainder 30
2 186 ÷ 30 = 6 remainder 6
3 30 ÷ 6 = 5 remainder 0

Examples of GCD Calculations

NumbersGCD
136 and 1484
105 and 1341
42 and 1566
72 and 513
142 and 522

Try Calculating GCD of Other Numbers







Related Calculators