🎯

Learning Goal

Part of: Understand the concept of a function and use function notation3 of 3 cluster items

Recognize sequences as functions

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.

Show more

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

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

Slides

Interactive presentations perfect for visual learners • In development

Slides

In development

Not yet available • Check back soon!