This preview shows page 1. Sign up to view the full content.
Unformatted text preview: numbers. Examples: 1. Let a = −1 and d = 4: 2. Let a = 7 and d = −3: 3. Let a = 1 and d = 2: Recurrence Rela$ons Deﬁnition: a recurrence relation for the sequence {an} is an equation that expresses an in terms of one or more of the previous terms of the sequence: an = an 1 + 3 ༉ A sequence is called a solution of a recurrence relation if its terms satisfy the recurrence relation. ༉ The initial conditions for a sequence specify the terms that precede the ﬁrst term where the recurrence relation takes eﬀect. Ques$ons about Recurrence Rela$ons Example 1:...
View
Full
Document
This document was uploaded on 02/27/2014 for the course CS 215 at SIU Carbondale.
 Spring '14
 M.Nojoumian
 Computer Science

Click to edit the document details