22.02.2014 Views

Discrete Mathematics University of Kentucky CS 275 Spring ... - MGNet

Discrete Mathematics University of Kentucky CS 275 Spring ... - MGNet

Discrete Mathematics University of Kentucky CS 275 Spring ... - MGNet

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Theorem: Assume c 1 ,c 2 ,? 1 ,? 2 ,R and r 1 ,r 2 ,C. Suppose that r 2 4c 1 r4c 2 = 0 has<br />

two distinct roots r 1 and r 2 . Then the sequence {a n } is a solution to the<br />

recurrence relation a n = c 1 a n-1 + c 2 a n-2 if and only if a n = ! 1<br />

r 1<br />

n + ! 2<br />

r 2<br />

n for n,N 0 .<br />

Example: a 0 = 2, a 1 = 7, and a n = a n-1 + 2a n-2 for n

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!