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

Home > Just Math
Lovely Fibonacci (Posted on 2013-05-11) Difficulty: 3 of 5
Let Fn be the nth Fibonacci number.

Prove: (Fmn-1) - (Fn-1)m is divisible by (Fn)2 for all m≥1 and n>1.

No Solution Yet Submitted by Danish Ahmed Khan    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
re: Counterexamples Comment 2 of 2 |
(In reply to Counterexamples by Jer)

Jer, your counter-example for the usual system seems to have a problem with it. In the standard numbering format for the sequence, F5 = 5, whereas you have considered it to be equal to 8. Setting F5 to the correct value of 5:

(F5) - (F2)^2 = 5 - 1^2 = 4 which IS divisible by (F3)^2 = 2^2 = 4.
  Posted by Justin on 2013-07-06 23:33:26

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 (10)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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