In this lecture our instructor will cover Recursion and Special Sequences. First, you will cover Fibonacci Sequence and its Recursive Formula. Then, you will round out the lecture with Iteration and four video examples.
If a sequence is
defined so that it depends on the value of the previous term, then
to find the kth term, you must first compute terms 2, 3, 4, , and
k 1. You will be given the first term.
This same comment
applies to finding the kth iterate of a function. You must first
compute the 1st, 2nd, , and (k 1)st
iterates, always evaluate each iterate for the numerical value x0
you are given.
Recursion and Special Sequences
Lecture Slides are screen-captured images of important points in the lecture. Students can download and print out these lecture slide images to do practice problems as well as take notes while watching the lecture.