Question

Find Greatest Common Divisor of 765844 and 836, using Euclidean algorithm.

Answer

The GCD of given numbers is 4.

Explanation

Step 1 :
Divide $765844$ by $836$ and get the remainder

765844 : 836 = 916 ( remainder is 68)

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

Step 2 :
Divide $836$ by $68$ and get the remainder

836 : 68 = 12 ( remainder is 20)

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

Step 3 :
Divide $68$ by $20$ and get the remainder

68 : 20 = 3 ( remainder is 8)

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

Step 4 :
Divide $20$ by $8$ and get the remainder

20 : 8 = 2 ( remainder is 4)

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

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

8 : 4 = 2 ( remainder is 0)

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

We can summarize an algorithm into a following table.

This solution can be visualized using a Venn diagram.

0,0

765844

836

191461

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

This page was created using

GCD Calculator