1 / 10

Recurrence

Recurrence. Relations. Roxanne Scott Iveta Ovsepyan Deborah Ellis. A Definition . A recurrence relation is a way of defining a sequence of numbers by defining the first term(s) and then prescribing an algorithm that shows us how to compute a n in terms of a i for i < n. Fibonacci

catriona-kissane
Download Presentation

Recurrence

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Recurrence Relations

  2. Roxanne ScottIveta OvsepyanDeborah Ellis

  3. A Definition A recurrence relation is a way of defining a sequence of numbers by defining the first term(s) and then prescribing an algorithm that shows us how to compute an in terms of ai for i < n. Fibonacci Let f1 = 1, f2 = 1, and for all n > 2 Let fn = f n-2 + fn-1

  4. Let L1 = 1, L2 = 3 And for all n > 2 Let Ln = L n-2 + L n-1 Let P0 = 0, P1=1 and let Pn = 2Pn-1 + Pn-2 Lucas Pell

  5. = # { U \in {1,2,3,….,n} : |U| = k Consider: n k “ n choose k ” 3 2 =

  6. RecurrenceRelations Recurrence Relations cu r r ence Re Relations

More Related