S.O.S. Mathematics CyberBoard

I need to show: F2n = Fn * Ln using induction

Where Fn stands for the nth Fibonacci number and Ln stands for the nth Lucas number.

This is problem #15 in chapter 1 of Number Theory by George Andrews. (I'm teaching myself for fun, this isn't homework.)

The book expects you to use induction. The only useful equations this chapter of the book (this is chapter 1) seems to provide are:

1. Fn = Fn-1 + Fn-2
2. F^2(n+1) - F(n)F(n+2) = (-1)^n
3. Ln = F(n+1) + F(n-1)
4. Ln = L(n-1 + L(n-2)

These were either given definitions, or previous problems that had to be solved, and can now be taken as givens.

I know that the quickest way to solve this is to substitute and then use the definition of F(m+n), but that definition is not a given here, so the author wants me to use one of the 4 givens.

I think I need another way to define F2n in terms of Fn, not just as F(2n-2) + F(2n-1).

Edit (Shadow): see post below

Please post your question in the main body of your topic. I've edited your original post.

_________________
(\ /)
(O.o)
(> <)
This is Bunny. Copy Bunny into your signature to help him on his way to world domination

I'm sure if you've seen a definition before it's fine to use it. Prove by induction doesn't necessarily mean EVERYTHING is induction.

In any case, , so try proving the first equality by induction instead.

_________________
(\ /)
(O.o)
(> <)
This is Bunny. Copy Bunny into your signature to help him on his way to world domination

Thanks. I'm going to play around with this some more.

Alternatively, prove that , which implies the result when you realise (apply this to the case N=2n).

_________________