Back to Exercise: Recognize sequences as functions

Exercises: Recognize Sequences as Functions

Work through each section in order. Show your work where indicated.

Grade 9·20 problems·~30 min·Common Core Math - HS Functions·group·hsf-if-a-3
Work through problems with immediate feedback
A

Recall / Warm-Up

1.

A function assigns each element of the domain exactly one element of the range. Which of the following is a function?

2.

The sequence 5, 8, 11, 14, 17, ... is graphed on the coordinate plane with nn on the horizontal axis. Which graph is correct?

3.

The function f(x)=2x+1f(x) = 2x + 1 has domain {1,2,3,4}\{1, 2, 3, 4\}. What is f(3)f(3)?

B

Fluency Practice

1.

The sequence a(n)=3n1a(n) = 3n - 1 has domain {1,2,3,4,5,...}\{1, 2, 3, 4, 5, ...\}. Find a(6)a(6).

2.

The sequence 4, 7, 10, 13, 16, ... is what type?

3.

The arithmetic sequence has first term a(1)=5a(1) = 5 and common difference d=4d = 4. Use the explicit formula a(n)=a1+d(n1)a(n) = a_1 + d(n-1) to find a(10)a(10).

4.

The geometric sequence has first term a(1)=2a(1) = 2 and common ratio r=3r = 3. Use the explicit formula a(n)=a1rn1a(n) = a_1 \cdot r^{n-1} to find a(4)a(4).

5.

Which of the following is a complete recursive definition for the sequence 2, 5, 8, 11, ...?

C

Varied Practice

1.

A student is asked to graph the sequence a(n)=2n+1a(n) = 2n + 1 for n=1,2,3,4,5n = 1, 2, 3, 4, 5. The student draws a solid straight line through the plotted points. What is wrong?

2.

The sequence 6, 10, 14, 18, 22, ... can be written as a(n)=___n+___a(n) = \_\_\_ \cdot n + \_\_\_ where nn starts at 1.

Also, a(7)=___a(7) = \_\_\_.

coefficient of n:
constant term:
a(7) value:
3.

The sequence 3, 6, 12, 24, 48, ... is geometric. What is the explicit formula?

4.

The sequence 3, 7, 11, 15, ... has explicit formula a(n)=4n1a(n) = 4n - 1 and recursive definition a(1)=3a(1) = 3, a(n)=a(n1)+4a(n) = a(n-1) + 4. Which statement is true?

5.

The Fibonacci sequence is defined by f(0)=1f(0) = 1, f(1)=1f(1) = 1, f(n+1)=f(n)+f(n1)f(n+1) = f(n) + f(n-1) for n1n \geq 1. What is f(5)f(5)?

D

Word Problems

1.

A theater has 20 seats in row 1 and adds 3 seats per row. The number of seats in row nn is s(n)=20+3(n1)s(n) = 20 + 3(n - 1).

1.

How many seats are in row 8?

2.

Write a recursive definition for s(n)s(n). Which option is complete and correct?

2.

A ball is dropped from a height of 80 cm. Each bounce reaches 75% of the previous height. The height after nn bounces is h(n)=80(0.75)nh(n) = 80 \cdot (0.75)^n.

What is the height (in cm) after 2 bounces? Round to the nearest whole number.

E

Error Analysis

1.

Student work: "The sequence 2, 5, 8, 11, 14, ... is just a pattern — not a function. Functions need equations like f(x)=2x+1f(x) = 2x + 1, not just a list of numbers."

Is the student correct? Identify the error.

2.

Student's recursive definition for the sequence 3, 9, 27, 81, ...:

"a(n)=3a(n1)a(n) = 3 \cdot a(n-1) for n2n \geq 2."

What is missing, and how does it affect the definition?

F

Challenge / Extension

1.

The Fibonacci sequence is defined by f(0)=1f(0) = 1, f(1)=1f(1) = 1, f(n+1)=f(n)+f(n1)f(n+1) = f(n) + f(n-1).

If you change the initial conditions to f(0)=2f(0) = 2 and f(1)=3f(1) = 3, what is the value of f(5)f(5) for this new sequence?

2.

The sequence a(n)=4n1a(n) = 4n - 1 has the same formula as the linear function y=4x1y = 4x - 1. Explain one key difference in how the two are graphed and why that difference matters.

0 of 20 answered