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.
KeywordsRecurrence Relation Discrete Mathematic Good Route Fibonacci Sequence Catalan Number
Unable to display preview. Download preview PDF.