Mock AIME 1 2006-2007 Problems/Problem 11

Revision as of 19:41, 22 August 2006 by JBL (talk | contribs)

Problem

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}$.

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.