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
)
Let F
n
be the nth Fibonacci number.
Prove that F
2
n+1
> F
2n
for all n > 1.
No Solution Yet
Submitted by
tomarken
Rating:
4.0000
(1 votes)
Comments: (
You must be logged in to post comments.
)
Subject
Author
Date
Super solution
Richard White
2021-05-12 08:58:43
re: looking online: d'Ocagne's Identity
tomarken
2021-05-07 09:42:16
looking online: d'Ocagne's Identity
Steven Lord
2021-05-06 21:34:18
solution
Charlie
2021-05-06 12:42:59
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 (7)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On
Chatterbox:
blackjack
flooble's webmaster puzzle
Copyright © 2002 - 2024 by
Animus Pactum Consulting
. All rights reserved.
Privacy Information