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)

Which recursive formula can be used to generate the sequence below, where f(1) = 3 and n ≥ 1?

3, –6, 12, –24, 48

The recursive formula for this sequence is

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

at n=1 f(n)= 3

at n = 2

f(2) = -2 (3) = -6

n = 3

f(3) = -2 (-6) = 12 and so on

answer: add the !

step-by-step explanation: then we will answer

the smallest possible measurement of the width is 14 feet

step-by-step explanation:

let's assume length of parallelogram is 'l'

width of parallelogram is 'w'

the perimeter of a parallelogram must be no less than 40 feet

so, we get

we are given

length of parallelogram is 6 feet

so,

l=6

we can plug it

now, we can solve for w

subtract both sides by 12

divide both sides by 2

and we get

so,

the smallest possible measurement of the width is 14 feet