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: THe equation C²=36 can have both -6 and 6 as possible values since -6 squared is 36 and so is 6 squared
I think c if it’s not right lmk
The ball should be aimed to the point of the wall that is about 45 degrees from the wall.
16 3/8 I so sorry if wrong glade I could help
