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

Home > Numbers
Coin flips (Posted on 2014-01-10) Difficulty: 2 of 5
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.)
  Subject Author Date
SolutionAn old Friend (spoiler)Steve Herman2014-01-10 11:05:35
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 (2)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2017 by Animus Pactum Consulting. All rights reserved. Privacy Information