Difference between revisions of "2015 AIME II Problems/Problem 12"
(Create Page) |
m (Add Solution Section) |
||
| Line 1: | Line 1: | ||
| − | ==Problem | + | ==Problem== |
There are <math>2^{10} = 1024</math> 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. | There are <math>2^{10} = 1024</math> 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. | ||
| + | |||
| + | ==Solution== | ||
Revision as of 19:24, 26 March 2015
Problem
There are 
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.
