Connecting...

This is a quick preview of the lesson. For full access, please Log In or Sign up.
For more information, please see full course syllabus of Algebra 2
For more information, please see full course syllabus of Algebra 2
Algebra 2 Recursion and Special Sequences
Lecture Description
The Fibonacci sequence is a common example for recursion. The formula used to define this sequence is called a recursive formula. 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. Another thing you'll learn about in this lecture is the iteration. Iteration is the process of composing a function with itself again and again and can be used to generate a sequence recursively. You'll see how in the examples.
Bookmark & Share
Embed
Share this knowledge with your friends!
Copy & Paste this embed code into your website’s HTML
Please ensure that your website editor is in text mode when you paste the code.(In Wordpress, the mode button is on the top right corner.)
×
Since this lesson is not free, only the preview will appear on your website.
- - Allow users to view the embedded video in full-size.
Next Lecture
Previous Lecture
Start Learning Now
Our free lessons will get you started (Adobe Flash® required).
Sign up for Educator.comGet immediate access to our entire library.
Membership Overview