Fibonacci and lucas series.

  • Thread starter Suk-Sci
  • Start date
  • #1
Suk-Sci
44
0
Fibonacci and lucas series...

Let a1,a2,a3...,an be the numbers of fibonacci series...
Let b1,b2...bn be the number of lucas series.

bn=an-1 + an+1 for n[tex]\geq[/tex]2

T.P.T : a2n=an*bn
 

Answers and Replies

  • #2
Raphie
151
0


T.P.T : a2n=an*bn

Keep in mind the following two identities...

(Lucas_(n-1) + Lucas_(n+1))/5 = Fibonacci_n
Lucas_n = (Golden Ratio)^n + (-1)^n(Golden Ratio)^-n

... where the Golden Ratio = ((sqrt 5) + 1)/2
 
  • #3
dodo
695
2


Hi, Suk-Sci,
you can substitute the given expression for the b's into the equation you want to prove; then you will have something only in terms of a's, that you can prove using induction.

If you want more help, try to show what you have done so far; that helps us help you. :)
 

Suggested for: Fibonacci and lucas series.

Replies
2
Views
377
Replies
2
Views
201
Replies
3
Views
848
  • Last Post
Replies
8
Views
2K
  • Last Post
Replies
6
Views
2K
  • Last Post
Replies
7
Views
242
  • Last Post
Replies
28
Views
2K
  • Last Post
Replies
5
Views
824
Replies
2
Views
834
Replies
6
Views
1K
Top