Unformatted text preview: 000 . Find a recurrence relation and initial conditions for the sequence a 1 , a 2 , . . . . Question 3. A recursive algorithm loops through the input to eliminate (or pick up) one item. A recur-rence relation for number of runs for input of size n is (Why?) a n = a n-1 + n, n ≥ 2 , a 1 = 1 . Find an explicit formula for the sequence using the method of iteration. Question 4. Solve the recurrence relations (that is, ±nd an explicit formula for the sequence a n ) a n = 2 a n-1 + 3 a n-2 , n ≥ 3 , a 1 = 5 , a 2 = 13 a n =-6 a n-1-9 a n-2 , n ≥ 2 , a = 1 , a 1 =-9 Page 1 Last updated April 29, 2011 by M. Bajger...
View Full Document
- Spring '08
- Algebra, Recurrence relation, Fibonacci number, explicit formula, Flinders Uni library, recursive algorithm loops