Question

Find Greatest Common Divisor of 91 and 32, using Euclidean algorithm.

Answer

The GCD of given numbers is 1.

Explanation

Step 1 :
Divide $91$ by $32$ and get the remainder

91 : 32 = 2 ( remainder is 27)

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

Step 2 :
Divide $32$ by $27$ and get the remainder

32 : 27 = 1 ( remainder is 5)

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

Step 3 :
Divide $27$ by $5$ and get the remainder

27 : 5 = 5 ( remainder is 2)

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

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

5 : 2 = 2 ( remainder is 1)

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

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

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

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

This page was created using

GCD Calculator