Which recursive formula can be used to generate the sequence below, where f(1) = 3 and n ≥ 1?
3, –6, 12, –24, 48, …
A.f (n + 1) = –3 f(n )
B.f (n + 1) = 3 f(n )
C.f (n + 1) = –2 f(n )
1 answer
C. f (n + 1) = –2 f(n )
3, –6, 12, –24, 48, …
A.f (n + 1) = –3 f(n )
B.f (n + 1) = 3 f(n )
C.f (n + 1) = –2 f(n )
1 answer