Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Solve the following recurrence relations and give a bound for each of them.

  1. $T(n)= 2T(n-3)+1$

  2. $T(n) = 5T(n-4)+n$

share|improve this question

1 Answer 1

a) Searched for good substitution (which gives recurrence $W_n=2W_{n-3}$) in form $T_n=W_n+a$ and got $T_n=W_n-1$.
b) Searched for good substitution (which gives recurrence $W_n=5W_{n-4}$) in form $T_n=W_n+an+b$ and got $T_n=W_n-\frac{n}{4}-\frac{5}{4}$.

share|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.