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: ( You must be logged in to post comments.)
  Subject Author Date
re: CounterexamplesJustin2013-07-06 23:33:26
QuestionCounterexamplesJer2013-05-13 13:54:05
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 (2)
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