Question

Find Greatest Common Divisor of 96 and 356, using Euclidean algorithm.

Answer

The GCD of given numbers is 4.

Explanation

Step 1 :
Divide $356$ by $96$ and get the remainder

356 : 96 = 3 ( remainder is 68)

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

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

96 : 68 = 1 ( remainder is 28)

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

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

68 : 28 = 2 ( remainder is 12)

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

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

28 : 12 = 2 ( remainder is 4)

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

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

12 : 4 = 3 ( 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

356

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

This page was created using

GCD Calculator