Skip to main content

2019 AMC 12B Problem 23

Problem 23 of 25HarderCombinatoricsProblem-Solving Techniques

How many sequences of 00s and 11s of length 1919 are there that begin with a 0,0, end with a 0,0, contain no two consecutive 00s, and contain no three consecutive 11s?

Answer choices

Show solution

Solution

No two 00s are adjacent, so the 00s are separated by blocks of 11s, each of size 11 or 22 (never 33). If there are kk zeros, there are k−1k-1 such blocks summing to 19−k19-k ones. The number of size-22 blocks is (19−k)−(k−1)=20−2k,(19-k)-(k-1)=20-2k, which must satisfy 0≤20−2k≤k−1,0\le20-2k\le k-1, i.e. 7≤k≤10.7\le k\le10. Summing (k−120−2k)\binom{k-1}{20-2k} over k=7,8,9,10k=7,8,9,10 gives (66)+(74)+(82)+(90)\binom66+\binom74+\binom82+\binom90 =1+35+28+1=1+35+28+1 =65.=65. Thus, C is the correct answer.
AoPS wiki

Tagged: partitions and compositions · combinations · casework

More practice