Question

Find Greatest Common Divisor of 527 and 765, using Euclidean algorithm.

Answer

The GCD of given numbers is 17.

Explanation

Step 1 :
Divide $765$ by $527$ and get the remainder

765 : 527 = 1 ( remainder is 238)

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

Step 2 :
Divide $527$ by $238$ and get the remainder

527 : 238 = 2 ( remainder is 51)

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

Step 3 :
Divide $238$ by $51$ and get the remainder

238 : 51 = 4 ( remainder is 34)

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

Step 4 :
Divide $51$ by $34$ and get the remainder

51 : 34 = 1 ( remainder is 17)

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

Step 5 :
Divide $34$ by $17$ and get the remainder

34 : 17 = 2 ( remainder is 0)

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

We can summarize an algorithm into a following table.

This solution can be visualized using a Venn diagram.

0,0

527

765

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

This page was created using

GCD Calculator