Question

Find Greatest Common Divisor of 4001 and 1312, using Euclidean algorithm.

Answer

The GCD of given numbers is 1.

Explanation

Step 1 :
Divide $4001$ by $1312$ and get the remainder

4001 : 1312 = 3 ( remainder is 65)

The remainder is positive ( $65 > 0$ ), so we will continue with division.

Step 2 :
Divide $1312$ by $65$ and get the remainder

1312 : 65 = 20 ( remainder is 12)

The remainder is still positive ( $12 > 0$ ), so we will continue with division.

Step 3 :
Divide $65$ by $12$ and get the remainder

65 : 12 = 5 ( remainder is 5)

The remainder is still positive ( $5 > 0$ ), so we will continue with division.

Step 4 :
Divide $12$ by $5$ and get the remainder

12 : 5 = 2 ( remainder is 2)

The remainder is still positive ( $2 > 0$ ), so we will continue with division.

Step 5 :
Divide $5$ by $2$ and get the remainder

5 : 2 = 2 ( remainder is 1)

The remainder is still positive ( $1 > 0$ ), so we will continue with division.

Step 6 :
Divide $2$ by $1$ and get the remainder

2 : 1 = 2 ( remainder is 0)

The remainder is zero => GCD is the last divisor $1$ .

We can summarize an algorithm into a following table.

This solution can be visualized using a Venn diagram.

0,0

4001

1312

4001

The GCD equals the product of the numbers at the intersection.

This page was created using

GCD Calculator