Recursive (Counting) AIME Intermediate
2015


Problem - 79

There are $2^{10} = 1024$ possible $10$-letter strings in which each letter is either an $A$ or a $B$. Find the number of such strings that do not have more than $3$ adjacent letters that are identical.


The solution for this problem is available for $0.99. You can also purchase a pass for all available solutions for $99.

report an error