Week 3, Sunday 3.1-3.2

The reading was pretty dry for the most part. Consisting of theorems and proofs for the most part. The Eucledian algorithm seems very very powerful. I understand the process of both the Eucledian and the extended Euclidean but I am unsure how it really works. The eculidean algorithm seems perfect for a computer program. It would not be hard to program this in c++. We touched on the application of GCD and primes in the last chapter. Can't wait to get to crypto stuff when we can see where these theorems and lemmas are used!