standard_description: 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.
problem_activity: Problem 1
Which expressions below are equivalent to 1? Select all that apply.
Problem 2
What is the value of
$$n$$
in the equation below? Explain your answer.
$${2^n\cdot{2^3\over{2^5}}=1}$$


aligns: no