Day 12: mat385

• #1 straightforward
• #11 straightforward (no need for anchors/base cases)
• #20:
  • subtle need for three base cases. Otherwise how would you do $n=5$?

    Basically, the order tells you how many base cases you'll need (and this is a third-order recurrence relation).

  • You were to use the 2nd principle -- not use the formula directly.

Here are some old test 1s