Lecture 5

We covered sections 4.1-4.9. Much of this was focused around the Euclidean algorithm: an example of using it to find a gcd, an example proof using the divides relation, using the result to show that the algorithm computes the right thing.

Announcements

• We'll be releasing the first honors assignment soon. Watch piazza for announcements.
• If you've added the class late, contact Margaret for the password to enroll in moodle and piazza, as well as any extensions required to get you caught up.