Recursion & Recurrences

Some problems are easiest to solve by assuming you can already solve a smaller version. Crack the Tower of Hanoi, turn step-by-step rules into closed formulas, find a formula for the Fibonacci numbers, meet the Collatz conjecture (a recursive puzzle nobody has solved), find where repeated processes settle, and count tilings and brackets recursively.