(n choose 0)*F(0) + (n choose 1)*F(1) + ... + (n choose n)*F(n)=F(2n)

I'm beginning to think induction is a bad approach...

Printable View

- February 4th 2011, 07:00 PMveronicak5678Fibonacci Proof II
(n choose 0)*F(0) + (n choose 1)*F(1) + ... + (n choose n)*F(n)=F(2n)

I'm beginning to think induction is a bad approach... - February 4th 2011, 11:57 PMDrexel28
- February 16th 2011, 04:04 AMPaulRS
A couple more proofs here.

A more general form would be: ( setting you get the particular case above).