1.1-1.2 and 3.1, due on September 1

1. The part of this reading which was most difficult for me to understand was the proof of the theorem which states that if a and b are two integers with at least one of them nonzero, and d=gcd(a,b), then there exist integers x, y such that ax+by=d. I understood up until "Start with j=1."

2. The most interesting part of this material for me was section 1.1, where it talked about the history and importance of Cryptography. It really got me excited for this course, because I've been spending a lot of time doing research in pure math and will be fun to be doing something with apparent applications.