We see from the recurrence relation that a2

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: let {an} be a sequence that satisfies the recurrence relation an = an- 1 + 3 for n = 1, 2, 3, 4, … suppose that a0 = 2, what are a1 , a2 and a3? Solution: here a0 = 2 is the initial condition. We see from the recurrence relation that a1 = 2 + 3 = 5 a2 = 5 + 3 = 8 a3 = 8 + 3 = 11 … Ques$ons about Recurrence Rela$ons Example 2: let {an} be a sequence that satisfies the recurrence relation an = an- 1 – an- 2 for n = 2, 3, 4, … suppose that a0 = 3 and a1 = 5. What are a2 and a3? Solution: here the initial conditions are a0 = 3 and...
View Full Document

This document was uploaded on 02/27/2014 for the course CS 215 at SIU Carbondale.

Ask a homework question - tutors are online