Question

Problem 1. (1 point) 1. Find a recursive definition for the sequence 2, 3, 5, 9, 17,... Assume the first term in the sequence is indexed by n = 1, and enter f_{n-1} as f(n - 1). f(1) = 2 and f_n = f(n-1) for n > 1. 2. Find a formula for the nth term that depends only on n f_n = Note: In order to get credit for this problem all answers must be correct.

          Problem 1.
(1 point)
1. Find a recursive definition for the sequence 2, 3, 5, 9, 17,... Assume the first term in the sequence is indexed by n = 1, and enter f_{n-1} as f(n - 1).
f(1) = 2 and f_n = f(n-1) for n > 1.
2. Find a formula for the nth term that depends only on n
f_n =
Note: In order to get credit for this problem all answers must be correct.

Problem 1.
(1 point)
1. Find a recursive definition for the sequence 2, 3, 5, 9, 17,... Assume the first term in the sequence is indexed by n = 1, and enter fn-1 as f(n - 1).
f(1) = 2 and fn = f(n-1) for n > 1.
2. Find a formula for the nth term that depends only on n
fn =
Note: In order to get credit for this problem all answers must be correct.

Added by Rebekah G.

Calculus: Early Transcendentals

James Stewart 8th Edition

Instant Answer

Solved by Expert Sri K

05/29/2023

Step 1

So, we can define the recursive formula as: f(1) = 3 f(n) = f(n-1) + 2^(n-2) for n > 1 Now, let's find a formula for the nth term that depends only on n. We can see that the sequence is a sum of powers of 2: 3 = 1 + 2 5 = 1 + 2 + 2 Show more…

Show all steps

Thanks for your feedback!

1. Find a recursive definition for the sequence 2, 3, 5, 9, 17,... Assume the first term in the sequence is indexed by n = 1, and enter f_{n-1} as f(n - 1). f(1) = and f_n = for n > 1. 2. Find a formula for the nth term that depends only on n f_n = Note: In order to get credit for this problem all answers must be correct.