perplexus.info :: Just Math : Fibonacci Inequality

Fibonacci Inequality (Posted on 2021-05-06)

Let F_n be the nth Fibonacci number.

Prove that F²_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:

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

Chatterbox:


perplexus dot info