It often happens that, in studying a sequence of numbers a n , a connection between a n and a n- 1, or between a n and several of the previous a i ,i < n, is obtained. This connection is called a recurrence relation; it is the aim of this chapter to illustrate how such recurrences arise and how they may be solved.


Recurrence Relation Discrete Mathematic Good Route Fibonacci Sequence Catalan Number 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag London 2002

Authors and Affiliations

  • Ian Anderson
    • 1
  1. 1.Department of MathematicsUniversity of Glasgow, University GardensGlasgowUK

Personalised recommendations