Question

Find Greatest Common Divisor of 807 and 481, using Euclidean algorithm.

Answer

The GCD of given numbers is 1.

Explanation

Step 1 :
Divide $807$ by $481$ and get the remainder

807 : 481 = 1 ( remainder is 326)

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

Step 2 :
Divide $481$ by $326$ and get the remainder

481 : 326 = 1 ( remainder is 155)

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

Step 3 :
Divide $326$ by $155$ and get the remainder

326 : 155 = 2 ( remainder is 16)

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

Step 4 :
Divide $155$ by $16$ and get the remainder

155 : 16 = 9 ( remainder is 11)

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

Step 5 :
Divide $16$ by $11$ and get the remainder

16 : 11 = 1 ( remainder is 5)

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

Step 6 :
Divide $11$ by $5$ and get the remainder

11 : 5 = 2 ( remainder is 1)

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

Step 7 :
Divide $5$ by $1$ and get the remainder

5 : 1 = 5 ( 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

807

481

269

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

This page was created using

GCD Calculator