We revisited the example from Sec 5.2 of a proof by strong induction, and showed how we can write an algorithm using the idea of the proof.

We then covered the beginning of Sec 5.3, on recursive definitions. In particular, we focused on recursively defined functions on the natural numbers. See the examples we covered in class, and Examples 1-3 in the textbook (pp366-368).

For HW#1, please write out solutions to the following exercises

Sec 5.1: #3 & 4

Sec 5.2: #3 & 4

Sec 5.3: #1-3

(A screenshot of the latter exercises is also included below. For the Sec 5.1 and 5.2 exercises, see the previous Class Recaps.)