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
Answer:
a.) 
b.) 
c.) $
Step-by-step explanation:
a.) If she earns $7 'per' hour, this multiplication. After a week, we need to see how many hours she worked to earn $91, so this goes behind the equal sign. Let <em>h</em> be the unknown number of hours:

Solve for h. Divide both sides by 7:

Sylvia worked 13 hours at a rate of $7 an hour.
b.) She can work at most 15 hours a week. At 'most' can also mean less than or equal to. Let <em>h</em> be hours:

Sylvia can work less than or equal to 15 hours per week.
c.) If Sylvia can work 15 hours, plug in this value for <em>h</em> into an equation when she earns $7 per hour. Let the product of the hours and money equal <em>t</em> for total:

The most money Sylvia can earn in a week is $105.
<em>Finito.</em>
The answer is 6/21 is not in its simplest form as you can still divide them both by 3