Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

How can i solve this equation? I am really stuck

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



share|cite|improve this question
First you solve the homogeneous version (without the $3n+1$), using the characteristic equation. – The Chaz 2.0 May 9 '13 at 12:43
A usual way to do that is to solve the homogeneous part. And then to find a particular solution by the method of undetermnined coefficients. Finally sum these two and determine the constants thanks to the initial conditions. – 1015 May 9 '13 at 12:43
Here is the method. Do not forget to upvote the answers if you benefit from them. – Mhenni Benghorbal May 9 '13 at 12:44
Another technique. – Mhenni Benghorbal May 9 '13 at 13:23
@vadim123: Just scroll the page down till you reach the answer you want and then copy the address. – Mhenni Benghorbal May 9 '13 at 13:36

Setting $S_n=T(n)+3n$, you'll obtain $$ S_n=S_{n+1}+S_{n+2}-8. $$

share|cite|improve this answer
Just set $F_n=T(n)+3n-8$ immediately and you obtain the Fibonacci recursion. – Raskolnikov May 9 '13 at 12:46
@Raskolnikov: Certainly. – Boris Novikov May 9 '13 at 12:47

Your Answer


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.