HowManyNumbers Logo

Greatest Common Divisor (GCD) of 105 and 10

The greatest common divisor (GCD) of 105 and 10 is 5.

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 105 and 10?

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 105 ÷ 10 = 10 remainder 5
2 10 ÷ 5 = 2 remainder 0

Examples of GCD Calculations

NumbersGCD
187 and 241
76 and 13319
32 and 671
77 and 497
23 and 1301

Try Calculating GCD of Other Numbers







Related Calculators