
Page 1 of 3
Download
Get this sheet
SubscriptionOpen any sheet in any course, up to 40 a month, keys included. Or $40 month to month.
$25/mo, billed yearly
SubscribeTry one first: a free Chapter 1 worksheet (PDF, no sign-in).
What's on the worksheet
- Hannah stacks wooden blocks into towers.
- Owen counts the strings of length n over the alphabet \a, b, c\ in which an a is never immediately followed by a b.
- A coin is tossed n times and the list of heads (H) and tails (T) is written down.
- A class of 2n students splits into n lab pairs; only who works with whom matters.
- Priya plans to hike a trail of n km over several days.
- Malik splits n friends (n ≥ 2) into two groups for a game, and neither group may be empty.
Teach it first
The free lesson teaches it with worked examples and practice problems.
Setting up a recurrence from a counting problem: the lesson ›More Chapter 9 worksheets: Recurrence relations
- 9.1The Fibonacci sequence
- 9.2Setting up a recurrence from a counting problem
- 9.3Solving and checking a two-term recurrence
- 9.4Two-term recurrences with a repeated root