Show all the steps of the Euclidean Algorithm p200 of the te

Show all the steps of the Euclidean Algorithm (p.200 of the text) to find the gcd of x = 525 and 770.

Solution

We are finding GCD(770, 525) using Euclidean algorithm .

Consider

770 = (525) .1 + 245

525 = (245).2 + 35

245 = (35) . 7 + 0

Since the last non- zero reainder is 35.

hence the GCD( 770 , 525 ) = 35