HowManyNumbers Logo

Greatest Common Divisor (GCD) of 125 and 101

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

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 125 ÷ 101 = 1 remainder 24
2 101 ÷ 24 = 4 remainder 5
3 24 ÷ 5 = 4 remainder 4
4 5 ÷ 4 = 1 remainder 1
5 4 ÷ 1 = 4 remainder 0

Examples of GCD Calculations

NumbersGCD
63 and 1809
194 and 962
110 and 955
158 and 1342
169 and 971

Try Calculating GCD of Other Numbers







Related Calculators