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 defines a strictly increasing sequence?
Think about a sequence of numbers.
Provide an example of a recurrence relation.
Consider sequences that build on previous terms.
What is the recurrence relation for strictly increasing sequences?
Think about how sequences can build upon each other.
True or False: The initial condition a(1) must be 1.
Recall the basics of sequence counting.
Using the given recurrence, find a(n) for n = 6 if a(1) = 1 and a(2) = 1.
Refer back to earlier initial conditions.
Prove that a(n) is greater than 0 for n >= 1.
Induction can help here.
4 more questions in this section. Enroll free to practise them all.
Enroll free