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

Thank you for watching the video.

To unlock all 5,300 videos, start your free trial.

Recursion Sequences - Problem 2

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

Share

A recursive formula for a number pattern is a way to describe each term by referring to the term before it. Notationally, our unknown term is called term n, and the term in the pattern before it is called the "n minus one" term. A recursive formula should always tell us the first number in the pattern. To find the numbers that come next, we start at the first term and then apply the rule in the formula. Then we apply the rule again and again until we have found our desired terms; each one based on the the term before it.

Transcript Coming Soon!

© 2016 Brightstorm, Inc. All Rights Reserved. Terms · Privacy