Learning Goal
Part of: Understand the concept of a function and use function notation — 3 of 3 cluster items
Recognize sequences as functions
**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.
Show moreShow less
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ₙ 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
Prerequisites
Slides
Interactive presentations perfect for visual learners • 2 slide decks
Slide Video
Watch narrated slides play like a video lesson • Narrated slide playback
Task-sets
Learning resource • 1 task-sets