Let F
n be the nth Fibonacci number.
Prove that F2n+1 > F2n for all n > 1.
(In reply to
looking online: d'Ocagne's Identity by Steven Lord)
There seem to be a lot of interesting identities around Fibonacci numbers, the way I saw it was that F2n = F2n+1 - F2n-1
Edited on May 7, 2021, 9:43 am
|
Posted by tomarken
on 2021-05-07 09:42:16 |