Back to Exercise: Determine explicit or recursive expressions

Exercises: Determine Explicit, Recursive, or Procedural Representations

Work through each section in order. Show your work where indicated. For recursive definitions, always include both the initial value and the recursion rule.

Grade 9·20 problems·~28 min·Common Core Math - HS Functions·standard·hsf-bf-a-1a
Work through problems with immediate feedback
A

Warm-Up: Review What You Know

1.

If f(x)=3x1f(x) = 3x - 1, what is f(4)f(4)?

2.

A sequence is defined as a function with what type of domain?

3.

The sequence ana_n has a1=10a_1 = 10 and each term is 4 less than the previous. What is a3a_3?

B

Fluency Practice

1.

A parking garage charges $5 to enter plus $3 per hour. The explicit formula for the total cost is C(h)=3h+5C(h) = 3h + 5. Find C(7)C(7).

2.

A bank account starts with $2000 and grows by 4% per year. The explicit formula is V(t)=2000(1.04)tV(t) = 2000(1.04)^t. Find V(3)V(3). Round to the nearest cent.

3.

A sequence starts at f(0)=6f(0) = 6. Each term is 5 more than the previous. Which is a correct recursive definition?

4.

A recursive sequence is defined by f(0)=3f(0) = 3 and f(n)=f(n1)2f(n) = f(n-1) \cdot 2. What is f(4)f(4)?

5.

The explicit formula f(n)=4n+7f(n) = 4n + 7 corresponds to a recursive definition with f(0)=7f(0) = 7. What value is added at each step (the common difference)?

C

Varied Practice

1.

A financial analyst needs to find the value of a savings account after exactly 40 years. Which representation is most efficient for this purpose?

2.

The recursive definition f(0)=500f(0) = 500, f(n)=f(n1)1.05f(n) = f(n-1) \cdot 1.05 represents an exponential function. The equivalent explicit formula is f(n)=500(000000)nf(n) = 500 \cdot (\text{\hspace{0.2em}\fbox{\phantom{000000}}\hspace{0.2em}})^n, and the common ratio is   ̲ ̲ ̲ ̲ ̲ ̲ ̲ ̲ ̲ ̲ ̲ ̲ ̲ ̲ ̲ ̲ ̲ ̲ ̲ ̲ ̲ ̲   .

base of the explicit formula:
common ratio:
3.

A shipping company charges $15 for items up to 5 lb, then $3 for each additional pound, plus $0.10 per mile of delivery. Write numbered steps for computing the total cost. Then explain in one sentence why this procedural description defines a valid function.

4.

A recursive sequence is defined by g(0)=2g(0) = 2 and g(n)=g(n1)3g(n) = g(n-1) \cdot 3. A student wants g(50)g(50) and writes: "g(50)=g(49)+3=50+3=53g(50) = g(49) + 3 = 50 + 3 = 53." What is the student's error?

5.

For f(0)=1f(0) = 1 and f(n)=f(n1)+4f(n) = f(n-1) + 4, compute f(3)f(3) using the recursive definition. Verify with the explicit formula f(n)=4n+1f(n) = 4n + 1. Enter the value of f(3)f(3).

D

Word Problems

1.

A plumber charges a $75 base fee plus $40 per hour.

The explicit formula for total cost is C(h)=40h+75C(h) = 40h + 75. Find the cost for 8 hours of work.

2.

A rabbit population is modeled recursively: P(0)=50P(0) = 50 and P(n)=2P(n1)10P(n) = 2 \cdot P(n-1) - 10, where nn is the generation number.

What is the population in generation 3?

3.

A phone plan charges $30 for up to 2 GB of data, then $10 for each additional GB over 2 GB, plus $0.05 per text message.

Write a numbered procedural description for computing the monthly cost given data (in GB) and number of texts. Explain in one sentence why this is a valid function definition.

E

Error Analysis

1.

A student is given f(0)=8f(0) = 8 and f(n)=f(n1)+6f(n) = f(n-1) + 6. To find f(100)f(100), the student writes: "f(100)=f(99)+6=99+6=105f(100) = f(99) + 6 = 99 + 6 = 105."

What error did the student make?

2.

A student writes a recursive definition for the sequence 3, 8, 13, 18, ...: "f(n)=f(n1)+5f(n) = f(n-1) + 5"

What is missing from this recursive definition, and why does it matter?

F

Challenge / Extension

1.

A recursive definition is: g(0)=200g(0) = 200 and g(n)=g(n1)0.8g(n) = g(n-1) \cdot 0.8. Translate to explicit form: g(n)=000000(000000)ng(n) = \text{\hspace{0.2em}\fbox{\phantom{000000}}\hspace{0.2em}} \cdot (\text{\hspace{0.2em}\fbox{\phantom{000000}}\hspace{0.2em}})^n. Then find g(5)g(5) rounded to the nearest whole number:   ̲ ̲ ̲ ̲ ̲ ̲ ̲ ̲ ̲ ̲ ̲ ̲ ̲ ̲ ̲ ̲ ̲ ̲ ̲ ̲ ̲ ̲   .

initial value:
common ratio:
g(5) rounded:
2.

The sequence defined by P(0)=10P(0) = 10 and P(n)=2P(n1)5P(n) = 2 \cdot P(n-1) - 5 does not have an obvious simple explicit formula. Compute P(0)P(0) through P(4)P(4). Then explain: does a recursive definition require an explicit formula to be a valid, complete function definition?

0 of 20 answered