INSTRUCTORSCarleen EatonGrant Fraser
Loading video...

Start Learning Now

Our free lessons will get you started (Flash® 10 required).
Get immediate access to our entire library.

Sign up for

Membership Overview

  • Unlimited access to our entire library of courses.
  • Search and jump to exactly what you want to learn.
  • *Ask questions and get answers from the community and our teachers!
  • Practice questions with step-by-step solutions.
  • Download lesson files for programming and software training practice.
  • Track your course viewing progress.
  • Download lecture slides for taking notes.
  • Learn at your own pace... anytime, anywhere!

Recursion and Special Sequences

  • 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.

  • In calculating 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.