Register
If a sequence is defined recursively by f(o)=3 and f(n+1) = -f(n) + 5 for n≥0, then f(2) is?
84.3k views
5 votes
If a sequence is defined recursively by f(o)=3 and f(n+1) = -f(n) + 5 for n≥0, then f(2) is?

User Takashi
by
5.4k points

1 Answer

3 votes
f(0)=3 and f(n+1) = -f(n) + 5 for n≥0
so f(1) = -f(0) + 5 = -3 + 5 = 2
f(2) = -f(1) + 5 = -2 + 5 = 3


User Clawish
by
6.1k points
Ask a Question
Welcome to QAmmunity.org, where you can ask questions and receive answers from other members of our community.

6.6m questions

8.8m answers

Other Questions

What is the least common denominator of the four fractions 20 7/10 20 3/4 18 9/10 20 18/25
What is 0.12 expressed as a fraction in simplest form
arlos has $690,000 he wants to save. If the FDIC insurance limit per depositor, per bank, is $250,000, which of these ways of distributing his money between three banks will guarantee that all of his money
Solve using square root or factoring method plz help!!!!.....must click on pic to see the whole problem
What is the initial value and what does it represent? $4, the cost per item $4, the cost of the catalog $6, the cost per item $6, the cost of the catalog?
Link Copied!