lesson
Understanding Recursive Definitions of Sequences
Understand how a recursive definition defines each term based on previous terms.
Updated 2 months ago · 4 views
Premium Lesson
This lesson is part of a track
Public learning track
Sequences as Functions
5 lessons
Goal
Recognize sequences as functions defined on subsets of integers, and write and distinguish between recursive and explicit definitions using function notation.
5 lessons
0 of 5 done
- Sequences as Functions with Integer DomainsUp next
- Understanding Recursive Definitions of SequencesYou are here
- Writing Recursive Formulas from Given Sequence TermsNot started yet
- Evaluating Sequence Terms Using Function NotationNot started yet
- Identifying Recursive vs. Explicit Sequence DefinitionsNot started yet
Learning standards covered
HSF.IF.A.3Common Core State Standards · Math · 10th GradeRecognize that sequences are functions, sometimes defined recursively, whose domain is a subset of the integers. For example, the Fibonacci sequence is defined recursively by f(0) = f(1) = 1, f(n+1) = f(n) + f(n-1) for n ≥ 1.
Open Global Standard:OGM.12.FNC.5
OGM.12.FNC.5OGM.12.FNC.5