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).
CC.9-12.F.IF.3 Understand the concept of a function and use function notation. 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).Are you ready for some Common Core Math quizzes in section 9-12.F.IF.3? Download our app to get started
Vote:
Section: