HowManyNumbers Logo

Greatest Common Divisor (GCD) of 123 and 72

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

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 123 ÷ 72 = 1 remainder 51
2 72 ÷ 51 = 1 remainder 21
3 51 ÷ 21 = 2 remainder 9
4 21 ÷ 9 = 2 remainder 3
5 9 ÷ 3 = 3 remainder 0

Examples of GCD Calculations

NumbersGCD
132 and 1113
123 and 1031
123 and 1743
13 and 11713
186 and 462

Try Calculating GCD of Other Numbers







Related Calculators