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.
What is a valid sequence for n=3?
Remember what numbers are in increasing order and start with 1 and end with n.
For n=2, how many valid sequences can you describe?
Think about the definition of valid sequences.
What does the function f(n) represent?
Think about what constitutes a valid sequence overall.
What is the recurrence relation we've defined?
Review how second last term influences the calculation.
Given f(5) = 4, discuss the structures of valid sequences that exist.
How many ways can numbers be arranged?
Derive f(n) for n=6 and show all sequences possible.
Construct from earlier instances.
5 more questions in this section. Enroll free to practise them all.
Enroll free