## Math

### HS Statistics & Probability

Back
HSF-IF.A.3
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.
View child tags
View All 25 Lessons
HSF-IF.A.1
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).
HSF-IF.A.2
Use function notation, evaluate functions for inputs in their domains, and interpret statements that use function notation in terms of a context.
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.