anonymous
  • anonymous
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)
Mathematics
  • Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
SOLVED
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
chestercat
  • chestercat
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
DanJS
  • DanJS
do you notice the pattern in the numbers?
DanJS
  • DanJS
a consecutive term is double the last and oposite sign
DanJS
  • DanJS
the next term --- f( n + 1) is --- = -2 times previous term --- -2 * f(n)

Looking for something else?

Not the answer you are looking for? Search for more explanations.

More answers

DanJS
  • DanJS
or since they gave you choices, you can just try each one out to see which works w/o knowing anything
DanJS
  • DanJS
the first term f(n) is 3 given to you, put that in each answer choice and see which gives back the next value in the sequence
anonymous
  • anonymous
I got -6

Looking for something else?

Not the answer you are looking for? Search for more explanations.