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

Home > Numbers
Fibo again (Posted on 2014-06-26) Difficulty: 2 of 5
Prove the following theorem:

Every positive integer can be represented uniquely as the sum of one or more distinct Fibonacci numbers without including any two consecutive Fibonacci numbers.

Examples: 8=8; 27=21+5+1

No Solution Yet Submitted by Ady TZIDON    
No Rating

Comments: ( You must be logged in to post comments.)
  Subject Author Date
SolutionSolutiontomarken2014-06-26 09:53:47
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 (14)
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