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

Home > Numbers
No neighbors allowed (Posted on 2015-05-22) Difficulty: 3 of 5
How many subsets of {1,2,...,n} contain no consecutive integers?

  Submitted by Ady TZIDON    
No Rating
Solution: (Hide)
Answer: a(n)=f(n+2); f for Fibonacci number

Solution a(n) must cover all the qualifying subsets of n-1 integers
i.e, a(n-1) plus
all the qualifying subsets of n-2 elements, where to each of them integer n was added (the integer n-1 is absent!).
a(n)= a(n-1) + a(n-2) a(1)=2=f(3) so a(n)=f(n+2)

Comments: ( You must be logged in to post comments.)
  Subject Author Date
Hints/Tipsre: solution............spoiler Ady TZIDON2015-05-22 17:28:26
SolutionsolutionCharlie2015-05-22 15:37:25
Please log in:
Remember me:
Sign up! | Forgot password

Search body:
Forums (44)
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

Copyright © 2002 - 2019 by Animus Pactum Consulting. All rights reserved. Privacy Information