HowManyNumbers Logo

Greatest Common Divisor (GCD) of 160 and 36

The greatest common divisor (GCD) of 160 and 36 is 4.

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 160 and 36?

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 160 ÷ 36 = 4 remainder 16
2 36 ÷ 16 = 2 remainder 4
3 16 ÷ 4 = 4 remainder 0

Examples of GCD Calculations

NumbersGCD
21 and 1661
31 and 781
130 and 642
172 and 1324
74 and 1582

Try Calculating GCD of Other Numbers







Related Calculators