Difference between revisions of "Mock AIME 1 2006-2007 Problems/Problem 11"

(No difference)

Revision as of 15:45, 24 July 2006

11. Let $\mathcal{S}_{n}$ be the set of strings with only 0's or 1's with length $n$ such that any 3 adjacent place numbers sum to at least 1. For example, $00100$ works, but $10001$ does not. Find the number of elements in $\mathcal{S}_{11}$.