2015 AIME II Problems/Problem 12

Revision as of 19:23, 26 March 2015 by Swe1 (talk | contribs) (Create Page)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem 12

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.