Solve any maths problem

Equations, derivatives, integrals, matrices, triangles, primes, statistics — or a word problem the tutor breaks into parts.

Number-Theory · Gcd-And-Lcm

Gcd(17, 3120)

17,\ 3120

Step by step

  1. \gcd(17, 3120)

    Use Euclid's algorithm: replace the larger number by its remainder on division by the smaller, until the remainder is 0.

  2. 3120 = 183 \times 17 + 9

    Divide 3120 by 17: quotient 183, remainder 9.

  3. 17 = 1 \times 9 + 8

    Divide 17 by 9: quotient 1, remainder 8.

  4. 9 = 1 \times 8 + 1

    Divide 9 by 8: quotient 1, remainder 1.

  5. 8 = 8 \times 1 + 0

    Divide 8 by 1: quotient 8, remainder 0.

  6. \gcd(17, 3120) = 1

    The last non-zero remainder is 1.

Reveal the answer
\gcd(17, 3120) = 1