Embedded Files
Standards Assessed:
PC.F-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 (n is greater than or equal to 1).
PC.F-BF.A.2: Write arithmetic and geometric sequences both recursively and with an explicit formula, use them to model situations, and translate between two forms.
PC.F.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).
Report abuse