The Lucas numbers satisfy the recurrence relation Ln = Ln1
Chapter 11, Problem 11E(choose chapter or problem)
The Lucas numbers satisfy the recurrence relation Ln = Ln?1 + Ln?2,and the initial conditionsL0 = 2 andL1 = 1.a) Show that Ln = fn?1 + fn+1 for n = 2,3,..., where fn is the nth Fibonacci number.________________b) Find an explicit formula for the Lucas numbers.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer