relation recursion help

label Mathematics
account_circle Unassigned
schedule 1 Day
account_balance_wallet $5

Apr 30th, 2015

The least n for which the recursive formula is applicable is n=1, for the closed form is n=0. When we go from k to k+1 we deal with a formula

a(k+1) = a(k) + 2*a(k-1).

This recursive formula holds from k>=1, so k+1>=2 and the first n for which such a proof is possible is n=2. So we ought to check the direct form for n=1 and n=0.

The answer is 2 (base cases).

Actually, they are not true (a0 = 1 not= 2^0+(-1)^0 = 2, a1 = 3 not= 2^1+(-1)^1 = 1).


Apr 30th, 2015

Studypool's Notebank makes it easy to buy and sell old notes, study guides, reviews, etc.
Click to visit
The Notebank
...
Apr 30th, 2015
...
Apr 30th, 2015
Oct 23rd, 2017
check_circle
Mark as Final Answer
check_circle
Unmark as Final Answer
check_circle
Final Answer

Secure Information

Content will be erased after question is completed.

check_circle
Final Answer