Recurrences
Sequences defined step by step, and their shortcuts.
Pen and paper is fine · no calculator needed why?
Opens at level 42.
Lesson and untimed practice
Read the full lesson and try each skill without a clock. About 3 minutes to read.
skills · practice stats
-
Fibonacci not tried yet
worked example
F₁ = F₂ = 1, and each term is the sum of the two before it. What is F₉?
Answer: 34
- Keep adding the last two terms: 1, 1, 2, 3, 5, 8, 13, 21, 34.
- So F₉ = 34.
-
Step through a rule not tried yet
worked example
a₁ = 2 and aₙ = 3aₙ₋₁ − 1. What is a₅?
Answer: 122
- Apply the rule one step at a time: a₂ = 3 × 2 − 1 = 5.
- Then a₃ = 14, a₄ = 41, a₅ = 122.
-
Tower of Hanoi not tried yet
worked example
What is the minimum number of moves to solve the Tower of Hanoi with 8 disks?
Answer: 255
- Moving n disks means moving n − 1 disks aside, the big one once, then the n − 1 back on top: the count doubles and adds one each time, giving 2ⁿ − 1.
- 2⁸ − 1 = 256 − 1 = 255.
-
Spot the formula not tried yet
worked example
a₀ = 0 and aₙ = aₙ₋₁ + 2n − 1. What is a₂₄?
Answer: 576
- The terms go 0, 1, 4, 9, 16, …: adding the odd numbers 1, 3, 5, 7, … gives the squares, so aₙ = n².
- a₂₄ = 24² = 576.
rest ladder
- 1 day
- 3 days
- 7 days
- 14 days
- 30 days
- 60 days
- mastered · every 90 days