Question

Find Greatest Common Divisor of 34 and 58, using Euclidean algorithm.

Answer

The GCD of given numbers is 2.

Explanation

Step 1 :
Divide $58$ by $34$ and get the remainder

58 : 34 = 1 ( remainder is 24)

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

Step 2 :
Divide $34$ by $24$ and get the remainder

34 : 24 = 1 ( remainder is 10)

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

Step 3 :
Divide $24$ by $10$ and get the remainder

24 : 10 = 2 ( remainder is 4)

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

Step 4 :
Divide $10$ by $4$ and get the remainder

10 : 4 = 2 ( remainder is 2)

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

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

4 : 2 = 2 ( remainder is 0)

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

We can summarize an algorithm into a following table.

This solution can be visualized using a Venn diagram.

0,0

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

This page was created using

GCD Calculator