options: 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.

Use function notation, evaluate functions for inputs in their domains, and interpret statements that use function notation in terms of a context.

Understand that a function from one set (called the domain) to another set (called the range) assigns to each element of the domain exactly one element of the range. If f is a function and x is an element of its domain, then f(x) denotes the output of f corresponding to the input x. The graph of f is the graph of the equation y = f(x).
problem_activity: Task
Imagine Scott stood at zero on a life-sized number line.  His friend flipped a coin 50 times.  When the coin came up heads, he moved one unit to the right. When the coin came up tails, he moved one unit to the left. After each flip of the coin, Scott's friend recorded his position on the number line. Let $f$ assign to the whole number $n$, when $1 \leq n \leq 50$,
Scott's position on the number line after the $n^{\rm th}$ coin flip.
If $f(6) = 6$ what can you conclude about the outcomes of the first $6$ coin
tosses?  Explain.  What if $f(6) = -4$?
Is it possible that $f(7) = 2$?  Explain.
Find all integers $m$ so that the probability that $f(50) = m$ is zero.


correct_option_index: 1