Which recursive formula can be used to generate the sequence shown, where f(1) = 9.6 and n > 1? 9.6, –4.8, 2.4, –1.2, 0.6, ...

f(n + 1) = (–0.5)f(n)
f(n + 1) = (0.5)f(n)
f(n + 1) = f(0.5n)
f(n + 1) = f(–0.5n)

A recursive formula needs you need to plug in the term(s) that come before the term you're trying to find to get that term you're trying to find.

In your recursive formulas, f(n) is your current term and f(n+1) refers to the next term.  Let's use answer choice A as an example (though it might not be the right answer):

You know the first term, f(1) = 9.6, making n = 1.

To find the second term, n = 2, or f(n+1) = f(1 + 1) = f(2), you are told that f(n+1) = –0.5f(n), or -0.5 * f(n). If f(1) = 9.6, where n = 1, then f(n+1) or f(2) = -0.5*9.6.

This pattern would repeat over and over again.

Now back to the problem:

The easiest way to solve this problem is by plugging in your first term and seeing what  generates the sequence.

But first, notice that the sequence alternates between negative and positive numbers. That means the recursive formula must have a negative sign in it. You can go ahead and eliminate answers B and C.

You're left with A and D. Test out both:

Choice A, f(n + 1) = –0.5f(n)

f(1) = 9.6

f(2) = -0.5f(1) = -0.5(9.6) = -4.8

f(3) = -0.5f(2) = -0.5(-4.8) = 2.4

You don't need to go any further. Choice A works!

Choice D, f(n + 1) = f(–0.5n)

f(1) = 9.6

f(2) = f(–0.5n) = f(-0.5(1)) = f(-0.5)

Choice D does not mathematically work.

A f(n + 1) = –0.5f(n)

17   x 256=4352

sorry if this is wrong, i'm new.

step-by-step explanation: