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
6.40 units
You use the squaring method to fill in the triangle.
Count the sides 4 up and 5 across
Square them (16 and 25)
Add them together 16+25=41
Find the square root of 41 (6.40)
Good luck!
Idkfjdjiwkwhdjajajasjjaikajshsiskjdhdjdjsjjsjsjsjsjss
Answer:
(0,inf) {y║y>0}
Step-by-step explanation:
