HowManyNumbers Logo

Greatest Common Divisor (GCD) of 103 and 123

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

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 103 ÷ 123 = 0 remainder 103
2 123 ÷ 103 = 1 remainder 20
3 103 ÷ 20 = 5 remainder 3
4 20 ÷ 3 = 6 remainder 2
5 3 ÷ 2 = 1 remainder 1
6 2 ÷ 1 = 2 remainder 0

Examples of GCD Calculations

NumbersGCD
70 and 442
161 and 1041
35 and 1871
36 and 731
147 and 101

Try Calculating GCD of Other Numbers







Related Calculators