Search the courses, subjects, tracks, games and features, or jump straight to a page.
2 cards from this section. Quick, good the night before a test.
Define a recurrence relation in your own words.
Focus on how sequences can be interconnected.
What are initial conditions?
Think about why certain values are needed at the beginning.
What is a recurrence relation?
Think about how sequences are 'recursive' in nature.
True or False: Initial conditions are unnecessary for calculating terms in a recurrence relation.
Consider the foundation of a building; without starting points, you can't build up.
Given a recurrence relation f(n) = f(n-1) + f(n-2) and f(1) = 1, f(2) = 1, find f(5).
Break down to previous values step by step.
How would you set up a recurrence for a scenario where you're counting valid sequences of a different form, say starting with 2 and increasing?
Define your new starting point and conditions.
4 more questions in this section. Enroll free to practise them all.
Enroll free