1. a. If we measure an instance size of computing the greatest common divisor of m and n by the size of the second number n, by how much can the size decrease after one iteration of Euclid’s algorithm? b. Prove that an instance size will always decrease at least by a factor of two after two successive iterations of Euclid’s algorithm.

I uploaded the answer to a file hosting. Here's link:

cutt..ly/lxkFVRg

try this:

go tos official website.

click on your profile pic at the top right of the screen and click 'edit profile'.

click on "preferences" and press "year of birth".

and then just maybe try to reset whatever error made before by typing in the correct age details again. hope this !