Day 11, Mat385

Last time

Next time

• Announcements
  • Quiz today is over 3.1: recursive definitions

• Last time:
  • We finished section 3.1: recursive definitions, and got a good start on 3.2: recurrence relations

    By the way, Leo asked me a question at the end of the hour, about whether we could define Taylor polynomials recursively. Here's one implementation (pdf).

  • Marked up
    • highlights from 3.1
    • highlights from 3.2

• Today:
  • We'll wrap up 3.2 Recurrence Relations (here's my highlight worksheet 3.2, and our Closed form of First-Order induction)
  • Then work on 3.3: Analysis of Algorithms
  • Ending with a quiz.

• The Curious History of Venn Diagrams: A look at the curious history of Venn diagrams and how they blend logic with geometry (Scientific American)
  

• Some Fun, Motivating Examples from Propositional and Predicate Calculus