MathOverflow is a question and answer site for professional mathematicians. 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

Would someone be able to point me to a good resource explaining step by step the process for solving inhomogenous recurrence relations? (ie something of the form $ a_n = \sum{{b_i}{a_{n-i}}} + f(n)$ )

share|cite|improve this question
up vote 6 down vote accepted

One standard method is generating functions. Set $A(t)=\sum_{n=0}^\infty a_n t^n$ and $B(t)=\sum_{i=1}^\infty b_i t^i$. Then $$A(t)=a_0+B(t)A(t)+\sum_n f(n)t^n$$ so that $$A(t)=(1-B(t))^{-1}\left(a_0+\sum_n f(n)t^n\right).$$ For an excellent text on generating functions, see Herb Wilf's generatingfunctionology: .

share|cite|improve this answer

In addition to Wilf I also recommend Graham, Knuth, and Patashnik's Concrete Mathematics for these kinds of questions. GKP has a lot of good material on, for example, techniques for estimating the growth rate of recurrences even when closed forms seem difficult to obtain.

share|cite|improve this answer
Recommendation seconded! – Robin Chapman Apr 13 '10 at 18:39
Thirded. (Too bad isn't GKP isn't available online.) – Michael Lugo Apr 13 '10 at 23:12

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.