Monday May 5

We proved that the Euclidean algorithm does, indeed, calculate gcd(a,b).
I mentioned a couple of fun properties of it, like the relation to Khinchin's constant.

Then we proved what will be a much more useful result:
for any a,b in Z, there exist x,y in Z such that gcd(a,b) = xa+yb.