Recognize sequences as functions

Start lessonBegins with Sequences as functions · Slides

Teacher tools for this standard

Lesson Plan · Guided Notes · Exit Ticket · Re-teach · Homework

Lesson Plan →Objectives, pacing and practice, built from this lesson's brief.
Guided Notes →One page your students fill in and keep.
Exit Ticket →Three items at the end of class. No student accounts.
Re-teach →After an exit ticket: who missed what, and what to do tomorrow.
Homework →Assign practice; it grades itself.

HSF.IF.A.3

**HSF.IF.A.3**: 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.

HSF.IF.A.3: 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.

What you'll learn

Explain why a sequence is a function whose domain is a subset of the integers, connecting to the HSF.IF.A.1 definition
Use function notation a(n) or subscript notation a_n to represent terms of a sequence
Write explicit formulas for arithmetic and geometric sequences and evaluate them at specific terms
Write recursive definitions for sequences, including both the initial term(s) and the recurrence relation
Compute terms of the Fibonacci sequence using its recursive definition and explain why two initial terms are required
Graph sequences as discrete points on the coordinate plane and explain why the points are not connected

Review first: