The recursive formula will be equal to f(n + 1) = –2 f(n).
The complete question is given below:-
Which recursive formula can be used to generate the sequence below, where f(1) = 3 and n ≥ 1?
3, –6, 12, –24, 48, …
f (n + 1) = –3 f(n )
f (n + 1) = 3 f(n )
f (n + 1) = –2 f(n )
f (n + 1) = 2 f(n)
<h3>What is a function?</h3>
A function is defined as the expression that set up the relationship between the dependent variable and independent variable.
The recursive formula for this sequence is calculated as we will put the different values of n to find the values of the function in the series.
n = 1
f(n) = 3
n = 2
f(2) = -2 (3) = -6
n = 3
f(3) = -2 (-6) = 12 and so on
Therefore the recursive formula will be equal to f(n + 1) = –2 f(n).
To know more about function follow
brainly.com/question/25638609
#SPJ1
