Home > Numbers > Sequences
| Surprised? (Posted on 2012-12-15) |
 |
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.)
|
|
Please log in:
Forums (0)
Newest Problems
Random Problem
FAQ |
About This Site
Site Statistics
New Comments (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On
Chatterbox:
|
