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:
y=8,y=0
that's the answer I got tho
C. 0<p<3 is the answer (at most)
Hope dis helped :)
Answer:
C) 2 (2x + 3) (3x + 1)
Step-by-step explanation:
12x² + 22x + 6
2 ( 6x² + 11x + 3 )
2 [ 6x² + 9x + 2x + 3 ]
2 [ 3x ( 2x + 3 ) + 1 ( 2x + 3 ) ]
2 ( 2x + 3 ) ( 3x + 1 ) ⇒ C
Answer:
a. x=2, y=13
b. x=14, y=25
c. x=−4, y=13
Step-by-step explanation:
