HowManyNumbers Logo

Greatest Common Divisor (GCD) of 93 and 48

The greatest common divisor (GCD) of 93 and 48 is 3.

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 93 and 48?

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 93 ÷ 48 = 1 remainder 45
2 48 ÷ 45 = 1 remainder 3
3 45 ÷ 3 = 15 remainder 0

Examples of GCD Calculations

NumbersGCD
137 and 1761
127 and 1711
107 and 1851
45 and 1323
123 and 471

Try Calculating GCD of Other Numbers







Related Calculators