2.1, due on September 18

The most difficult part of the section was the proof of the Division Theorem. There was a part where the proof explains why r<|b|, but I didn't follow why that led to a contradiction. The theorem as a whole makes sense, and I understand the other parts of the proof.

The Euclidean Algorithm is pretty cool. I had never seen it before, so it's interesting to see that something so simple can give the greatest common divisor. What's more, the proof was pretty simple to write and understand.

Comments

Popular posts from this blog

8.4, due on December 4

8.7, due on December 11

8.5, due on December 6