Conjecture re Fibonacci numbers

  • Thread starter ramsey2879
  • Start date
841
0

Main Question or Discussion Point

Given [tex]A_1 = 3 \texttt{ and } A_n = A_{n-1}^{2} -2[/tex]; is there a way to prove the following:

[tex]\prod_{i=1}^{n}A_{i} = F_{2^{n+1}}[/tex]

or if someone has already proven this, can you give the reference?
 

Answers and Replies

841
0
Note of is relation can be found at the first comment re the sequence 3,7,47 .... See http://www.research.att.com/~njas/sequences/A001566" [Broken], but I would like a proof if it is known.
 
Last edited by a moderator:
42
0
These two identities should get you there.

[tex]
F_{2n}=L_{n}F_{n}
[/tex]

[tex]
L_{2n}=L_{n}^{2}-2(-1)^{n}
[/tex]

Where [tex]L_n[/tex] is the nth Lucas numbers.
 
841
0
These two identities should get you there.

[tex]
F_{2n}=L_{n}F_{n}
[/tex]

[tex]
L_{2n}=L_{n}^{2}-2(-1)^{n}
[/tex]

Where [tex]L_n[/tex] is the nth Lucas numbers.
Where can I find a proof of those identities?
 
42
0
Both identities can be proven using the closed form expressions for the Fibonacci and Lucas numbers. The closed form expressions should be easily accessible. The one for the Fibonacci numbers is also known as Binet's formula.
 

Related Threads for: Conjecture re Fibonacci numbers

Replies
1
Views
4K
Replies
10
Views
4K
Replies
4
Views
5K
  • Last Post
Replies
4
Views
3K
Replies
4
Views
13K
Replies
14
Views
3K
Replies
5
Views
5K
Replies
8
Views
6K
Top