Recurrence Relations for Recursive Sequences in Discrete Math

Calculating the elements of a sequence using an expression based on the element's position in the sequence is a straightforward process. Sometimes, however, elements of a sequence are best computed using one or more previous terms. In this lesson, we discuss the benefits and drawbacks of these recursive sequences and how to prove the recurrence relation is true. We also get a glimpse at the Method of Differences.

Timestamps
00:00 | Intro
00:14 | Spreadsheet Example
06:57 | Converting Spreadsheet Example to a Recursive Sequence
09:36 | Fibonacci Sequence Recurrence Relation
11:54 | Factorial Sequence as a Recursive Sequence
13:20 | Potential Computational Savings with Recursive Sequence
16:47 | Method of Differences Recursive Sequence
18:53 | Proving the Recurrence Relation

Hashtags
#recurrence #recursive #sequence