HowManyNumbers Logo

Greatest Common Divisor (GCD) of 45 and 190

The greatest common divisor (GCD) of 45 and 190 is 5.

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 45 and 190?

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 45 ÷ 190 = 0 remainder 45
2 190 ÷ 45 = 4 remainder 10
3 45 ÷ 10 = 4 remainder 5
4 10 ÷ 5 = 2 remainder 0

Examples of GCD Calculations

NumbersGCD
76 and 1831
128 and 1131
42 and 1337
117 and 1551
64 and 1382

Try Calculating GCD of Other Numbers







Related Calculators