Scribd
Upload
18 views1 page

Printed by Mathpad TRIAL EDITION 1

This document provides an alternate proof of the Fibonacci identity F2n+1 = 3F2n-1 - F2n-3. It substitutes n for 2n-1 in the left hand side and right hand side expressions. It then manipulates the left hand side to show it is equal to the right hand side, thereby proving the identity.

Uploaded by

Hunter Patton
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
18 views1 page

Printed by Mathpad TRIAL EDITION 1

This document provides an alternate proof of the Fibonacci identity F2n+1 = 3F2n-1 - F2n-3. It substitutes n for 2n-1 in the left hand side and right hand side expressions. It then manipulates the left hand side to show it is equal to the right hand side, thereby proving the identity.

Uploaded by

Hunter Patton
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Printed by Mathpad TRIAL EDITION

Alternate proof of (a) Proof: F 2n + 1 = 3F 2n 1 F 2n 3 Substitute n for 2n 1. LHS = F (2n 1) + 2 = Fn + 2 = Fn + Fn + 1 = Fn + Fn + Fn 1 = 2Fn + Fn Fn 2 = 3Fn Fn 2 Since LHS = RHS, (a) is proven. (a) RHS = 3Fn Fn 2

You might also like