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.

Featured Diagrams

Sequences as Functions with Integer Domains

5 lessons

0 of 5 done

Sequences as Functions with Integer DomainsUp next
Understanding Recursive Definitions of SequencesNot started yet
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

View full track

Standards Covered

HSF.IF.A.3Common Core State Standards · Math · Grade 10
Recognize 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.