How to Prove This Fibonacci Identity Involving Squares and Products?

  • Context: Graduate 
  • Thread starter Thread starter ramsey2879
  • Start date Start date
  • Tags Tags
    Identity
Click For Summary
SUMMARY

The discussion centers on proving the Fibonacci identity: F_{4n+3} + F_{4n+6} = F_{2n+1}^2 + F_{2n+4}^2. Participants suggest using the general formula for the nth Fibonacci number, F_{n}=\frac{\phi^n-(1-\phi)^n}{\sqrt{5}}, as a potential method for mathematical induction. Additionally, an identity involving products of Fibonacci numbers is mentioned, which could simplify the proof. The conversation emphasizes the need for verification before posting findings on Sloane's online encyclopedia of integer sequences.

PREREQUISITES
  • Understanding of Fibonacci numbers and their properties
  • Familiarity with mathematical induction techniques
  • Knowledge of the golden ratio, φ (phi)
  • Basic algebraic manipulation skills
NEXT STEPS
  • Explore mathematical induction proofs for Fibonacci identities
  • Study the properties of Fibonacci numbers in relation to their products
  • Research the general formula for Fibonacci numbers and its applications
  • Investigate Sloane's online encyclopedia of integer sequences for related sequences
USEFUL FOR

Mathematicians, educators, and students interested in number theory, particularly those focusing on Fibonacci identities and their proofs.

ramsey2879
Messages
841
Reaction score
3
Can someone guide me on how to prove that
F_{4n+3} + F_{4n+6} = F_{2n+1}^2 + F_{2n+4}^2

either side of the above is the difference

(F_{2n+2}*F_{2n+3} + F_{2n+4}^2) - (F_{2n}*F_{2n+1} + F_{2n+2}^2)

I intend to post this sequence F_{2n}*F_{2n+1} + F_{2n+2}^2, with a comment re a few properties thereof, on Sloane's online encyclopedia of integer sequences but would like to verify the above identity first.
 
Physics news on Phys.org
First thing springs to mind is to try use general formula for nth
Fibbonacci number:

F_{n}=\frac{\phi^n-(1-\phi)^n}{\sqrt{5}}

In order to proceed with math induction.But I'm unsure will it work or not.
I'm sure there are better methods ,though.
 
Last edited:
tehno said:
First thing springs to mind is to try use general formula for nth
Fibbonacci number:

F_{n}=\frac{\phi^n-(1-\phi)^n}{\sqrt{5}}

In order to proceed with math induction.But I'm unsure will it work or not.
I'm sure there are better methods ,though.

Thanks
I think there is an identity for the following that works:

F_{i}*F_{j} + F_{i+1}*F_{j+1} = F_{?}

Let j = i = 2n+1 then

F_{2n+1}^{2} + F_{2n+2}^{2} = F_{4n+3}
F_{2n+2}^{2} + F_{2n+3}^{2} = F_{4n+5}
F_{2n+2}^{3} + F_{2n+4)^{2} = F_{4n+7}
\\
F_{4n+3} +F_{4n+6} = F_{4n+3} + F_{4n+7} - F_{4n+5}
=F_{2n+1}^{2} + F_{2n+4}^{2}
 
Last edited:

Similar threads

  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 1 ·
Replies
1
Views
4K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
4K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
5K
  • · Replies 1 ·
Replies
1
Views
5K
  • · Replies 35 ·
2
Replies
35
Views
7K
Replies
6
Views
5K
  • · Replies 2 ·
Replies
2
Views
1K