Lesson 10 of 20 · about 15 min
Recurrences
A recurrence defines each term from the ones before it, like Fibonacci or the moves in the Tower of Hanoi. You'll turn recurrences into closed formulas you can compute instantly, and see where the mysterious 1.6ⁿ from tree recursion really comes from.
🔓 Unlock this lesson
This lesson is part of the DoingCamp Pass. Members get every lesson in every course, with all the interactive visuals, coding exercises and challenges.
In this lesson you'll learn:
- Recurrence relation
- Closed form
- Characteristic equation
Free to try in F06 Discrete Math:
The first 3 lessons of every course are free, no account needed.