All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Just Math
Fibonacci Inequality (Posted on 2021-05-06) Difficulty: 3 of 5
Let Fn be the nth Fibonacci number.

Prove that F2n+1 > F2n for all n > 1.

No Solution Yet Submitted by tomarken    
Rating: 4.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
re: looking online: d'Ocagne's Identity | Comment 3 of 4 |
(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

Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (0)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information