Home > Numbers
| Coin flips (Posted on 2014-01-10) |
 |
How many sequences of coin flips of length n have no appearance of 2 or more heads in a row?
|
|
Submitted by Ady TZIDON
|
|
Rating: 4.0000 (1 votes)
|
|
|
Solution:
|
(Hide)
|
SEQ(n) = F(n+2), F(a) denoting a-th Fibonacci number.
For full solution - see Steve Herman's post. |
Comments: (
You must be logged in to post comments.)
|
|
Please log in:
Forums (1)
Newest Problems
Random Problem
FAQ |
About This Site
Site Statistics
New Comments (6)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On
Chatterbox:
|
