HowManyNumbers Logo

Greatest Common Divisor (GCD) of 149 and 123

The greatest common divisor (GCD) of 149 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 149 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 149 ÷ 123 = 1 remainder 26
2 123 ÷ 26 = 4 remainder 19
3 26 ÷ 19 = 1 remainder 7
4 19 ÷ 7 = 2 remainder 5
5 7 ÷ 5 = 1 remainder 2
6 5 ÷ 2 = 2 remainder 1
7 2 ÷ 1 = 2 remainder 0

Examples of GCD Calculations

NumbersGCD
144 and 1062
101 and 931
106 and 1771
152 and 422
158 and 1182

Try Calculating GCD of Other Numbers







Related Calculators