AIME 2015 Problem 12

There are \(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.


Try more problems of AIME from this set AIME 2015
×

Problem Loading...

Note Loading...

Set Loading...