HowManyNumbers Logo

Greatest Common Divisor (GCD) of 55 and 28

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

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 55 ÷ 28 = 1 remainder 27
2 28 ÷ 27 = 1 remainder 1
3 27 ÷ 1 = 27 remainder 0

Examples of GCD Calculations

NumbersGCD
185 and 571
137 and 1401
167 and 1831
59 and 451
182 and 1642

Try Calculating GCD of Other Numbers







Related Calculators