We looked at the Euclidean Algorithm, as an excuse to talk about divisibility concepts from the early part of chapter 4. We also did examples of proofs using the definitions of divisibility and congruence mod k (sections 4.6 and 4.11).