Learn math, science, English SAT & ACT from
highquaility study
videos by expert teachers
Thank you for watching the preview.
To unlock all 5,300 videos, start your free trial.
Recursion Sequences  Problem 3
Alissa Fong
Alissa Fong
MA, Stanford University
Teaching in the San Francisco Bay Area
Alissa is currently a teacher in the San Francisco Bay Area and Brightstorm users love her clear, concise explanations of tough concepts
A recursive formula requires that you know the previous term in order to find the next one that is, you need to know term n1 in order to find term n. The formula itself will have " a sub n  1." An explicit formula only has "a sub n." You can find any term without having to know any terms around it. If you're asked to determine whether a formula is recursive or explicit, look to see if you're given the first term and " a sub n  1" (recursive) or just " a sub 1" (explicit.)
Transcript Coming Soon!
Please enter your name.
Are you sure you want to delete this comment?
Alissa Fong
M.A. in Secondary Mathematics, Stanford University
B.S., Stanford University
Alissa has a quirky sense of humor and a relatable personality that make it easy for students to pay attention and understand the material. She has all the math tips and tricks students are looking for.
Concept (1)
Sample Problems (6)
Need help with a problem?
Watch expert teachers solve similar problems.

Recursion Sequences
Problem 1 6,361 viewsGiven a_{1} = 1, a_{2} = 2, and a_{n} = 2a_{n−1} + a_{n−2}
Find the next three terms. 
Recursion Sequences
Problem 2 1,171 views 
Recursion Sequences
Problem 3 1,125 views 
Recursion Sequences
Problem 4 1,028 views 
Recursion Sequences
Problem 5 1,069 views 
Recursion Sequences
Problem 6 971 views
Comments (0)
Please Sign in or Sign up to add your comment.
·
Delete