Students should experience a variety of types of situations modeled by functions. Detailed analysis of any particular class of functions at this stage is not advised. Students should apply these concepts throughout their future mathematics courses.
Draw examples from linear and exponential functions. In F.IF.3, draw connection to F.BF.2, which requires students to write arithmetic and geometric sequences. Emphasize arithmetic and geometric sequences as examples of linear and exponential functions.

## Collection Contents

### Quiz - Linear and Exponential Relationships: Understand the concept of a function and use function notation: Standards: F.IF.1, F.IF.2, F.IF.3

by Allen Wolmer

Standards: F.IF.1, F.IF.2, F.IF.3
Member Rating
Curriki RatingC
'C' - Curriki rating

### F.IF.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.

by Allen Wolmer

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 denotes the output of f corresponding to the input x. The graph of f is the graph of the equation y = f.
Member Rating
Curriki RatingC
'C' - Curriki rating

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

by Allen Wolmer

Use function notation, evaluate functions for inputs in theirdomains, and interpret statements that use function notation in terms ofa context.
Member Rating
Curriki RatingC
'C' - Curriki rating

### F.IF.3 Recognize that sequences are functions, sometimes defined recursively, whose domain is a subset of the integers.

by Allen Wolmer

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 + f(n-1) for n ? 1.
Member Rating
Curriki RatingC
'C' - Curriki rating

Non-profit Tax ID # 203478467