HELP WITH RECURRENCE RELATIONS PROBLEM PLEASE!!?

2015-10-20 9:10 pm
A sequence is recursively defined by: T(0) = 1; T(1) = 2; T(n) = 2T(n-1) + T(n-2) for n ≥ 2

Prove that T(n) ≤ (5/2)^n for n ≥ 0

Thanks!

回答 (1)

2015-10-22 9:44 am
✔ 最佳答案
T(0) = 1 = (5/2)^0
So, it is true for n = 0

Suppose it ir true for n = k , where k > 0
That is, T(k) ≤ (5/2)^k

When n = k+1 ,
T(k+1)
= 2*T(k) + T(k-1)
≤ 2*(5/2)^k + (5/2)^(k-1)
= (5/2)^(k-1) * ( 2*5/2 + 1 )
= (5/2)^(k-1) * 6
< (5/2)^(k-1) * (25/4)
= (5/2)^(k+1)
Hence, it is true for n = k+1

By the mathematical induction, it is true for all non-negative integer n

Q.E.D.


收錄日期: 2021-05-02 14:11:13
原文連結 [永久失效]:
https://hk.answers.yahoo.com/question/index?qid=20151020131052AAOnLOA

檢視 Wayback Machine 備份