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

Home > Numbers > Sequences
Surprised? (Posted on 2012-12-15) Difficulty: 3 of 5
How many binary sequences of length n exist , with no successive zeroes within the sequence?
Please provide the formula, its proof and the values for n=5, n=10 and n=50.

  Submitted by Ady TZIDON    
No Rating
Solution: (Hide)
For a string of length n the number of sequences is
F(n+1) where F(n) represents the n-th Fibonacci number.

Comments: ( You must be logged in to post comments.)
  Subject Author Date
re: No Subject -- oh yes, f(50)Charlie2012-12-15 18:16:30
SolutionNo SubjectCharlie2012-12-15 17:54:37
Please log in:
Remember me:
Sign up! | Forgot password

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

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