lecture31 - Lecture 31 Linear Recurrence Relations...

Info iconThis preview shows pages 1–7. Sign up to view the full content.

View Full Document Right Arrow Icon
Lecture 31 Linear Recurrence Relations
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Recurrence relations A recurrence relation for the sequence {a(n)} is an equation that expresses a(n) in terms of previous elements in the sequence a(n) = 2*a(n-1) A sequence is called a solution of a recurrence relation if its terms satisfy the relation 1,2,4,8,16, …
Background image of page 2
Linear Recurrence Relations A linear, homogenous relation of degree k with constant coefficients k n k n n n a c a c a c a ... 2 2 1 1
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Examples Not linear Not homogenous Non-constant coefficients Degree 4 2 1 n n n a a a n a a a n n n 2 1 2 1 2 n n n a na a 4 2 n n a a
Background image of page 4
Linear Recurrence Relations Basic approach is to look for a solution of the form a n =r n . k n k n n n a c a c a c a ... 2 2 1 1
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Plugging in a n =r n yields Diving everything by r n-k , we get the characteristic equation k n k n n n r c r c r c r ... 2
Background image of page 6
Image of page 7
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 19

lecture31 - Lecture 31 Linear Recurrence Relations...

This preview shows document pages 1 - 7. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online