Question

Find Greatest Common Divisor of 330 and 156, using Euclidean algorithm.

Answer

The GCD of given numbers is 6.

Explanation

Step 1 :
Divide $330$ by $156$ and get the remainder

330 : 156 = 2 ( remainder is 18)

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

Step 2 :
Divide $156$ by $18$ and get the remainder

156 : 18 = 8 ( remainder is 12)

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

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

18 : 12 = 1 ( remainder is 6)

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

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

12 : 6 = 2 ( remainder is 0)

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

We can summarize an algorithm into a following table.

This solution can be visualized using a Venn diagram.

0,0

330

156

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

This page was created using

GCD Calculator