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.BF.A.2 Write arithmetic and geometric sequences both recursively and with an explicit formula, use them to model situations, and translate between the two forms.
HSF.BF.A.1 Write a function that describes a relationship between two quantities.*
HSF.LE.A.1 Distinguish between situations that can be modeled with linear functions and with exponential functions.
HSF.LE.A.2 Construct linear and exponential functions, including arithmetic and geometric sequences, given a graph, a description of a relationship, or two input-output pairs (include reading these from a table).
Please email scordinoj@issaquah.wednet.edu for a copy of any classroom notes. As there is no way to password protect the work, all notes are available via email in addition to hard copies provided in class.
enVisions Textbook: Lesson 3-4 (Pgs. 110-117)
I can determine if a series is arithmetic. I can find the common difference. I can find the next term in an arithmetic sequence. I can use and understand sequence notation.
IXL.com
Khan Academy
Algebra 1 --> Sequences --> Introduction to Arithmetic Sequences
Additional Website Links
I can write an arithmetic sequence recursively.
IXL.com
Khan Academy
Algebra 1 --> Sequences --> Constructing Arithmetic Sequences
Additional Website Links
I can write an arithmetic sequence explicitly.
IXL.com
Khan Academy
Algebra 1 --> Sequences --> Constructing Arithmetic Sequences
I can use my knowledge of arithmetic sequences to answer word problems.
IXL.com
Khan Academy
**Extension Opportunities for Arithmetic Sequences
Online Games/Activities (Some will be considerably more fun than others):