Lucas Numbers and Generating Functions

  1. Here is my problem and my attempt at the answer. Any help or advice is highly appreciated.
    With the famous sequence of Lucas numbers 1, 3, 4, 7, 11, 18... (Where each number is the sum of the last two and the first two are defined as 1 and 3.) use generating functions to find an explicit formula for the Lucas function.
    Attempted Solution
    We have
    where Fj denotes the jth Fibonacci number and n is going to infinity. Then we add that to
    Where F-1 = -1 and F0 = 0

    And that should get us a function of Lucas numbers right?:confused:
    Last edited: Oct 31, 2005
  2. jcsd
  3. Tide

    Tide 3,143
    Science Advisor
    Homework Helper

    The Lucas numbers satisfy the relation

    [tex]L_{n+1} = L_n + L_{n-1}[/tex]

    Just set [itex]L_n = a^n[/itex] and solve for a. Your generating function will be a linear combination of the two solutions. Apply your initial conditions ( [itex]L_1[/itex] and [itex]L_2[/itex]) to determine the two arbitrary constants and you're done! :)
  4. I should've been more specific, but we have to use the Fibonacci numbers to generate the Lucas numbers in this manner.

    EDIT: I changed it up a little bit as well.
    Last edited: Oct 31, 2005
  5. Tide

    Tide 3,143
    Science Advisor
    Homework Helper

    In that case, it should be apparent that [itex]L_n = F_{n+1} + F_{n-1}[/itex]
  6. Ok so I believe that matches what I was intending on getting at. Thank you again.
Know someone interested in this topic? Share a link to this question via email, Google+, Twitter, or Facebook

Have something to add?