HowManyNumbers Logo

Greatest Common Divisor (GCD) of 165 and 100

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

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 165 ÷ 100 = 1 remainder 65
2 100 ÷ 65 = 1 remainder 35
3 65 ÷ 35 = 1 remainder 30
4 35 ÷ 30 = 1 remainder 5
5 30 ÷ 5 = 6 remainder 0

Examples of GCD Calculations

NumbersGCD
48 and 17616
49 and 781
46 and 851
52 and 551
90 and 1866

Try Calculating GCD of Other Numbers







Related Calculators