Let b = ro, 71, 72,... be the successive remainders in the Euclidean algorithm applied to...

 

Transcribed Image Text:

Let b = ro, 71, 72,... be the successive remainders in the Euclidean algorithm applied to a and b. Show that after every two steps, the remainder is reduced by at least one half. In other words, verify that Ti+2 Let b = ro, 71, 72,... be the successive remainders in the Euclidean algorithm applied to a and b. Show that after every two steps, the remainder is reduced by at least one half. In other words, verify that Ti+2