Skip to main content

2021 AMC 10A Problem 20

Problem 20 of 25HarderCounting & Probability

In how many ways can the sequence 1,1, 2,2, 3,3, 4,4, 55 be rearranged so that no three consecutive terms are increasing and no three consecutive terms are decreasing?

Answer choices

Show solution

Solution

A permutation is valid exactly when the four comparison signs between consecutive terms alternate. Thus the signs must be either up-down-up-down or down-up-down-up. For the up-down-up-down pattern, the largest entry 55 must be in position 22 or position 4.4. If it is in position 2,2, let the entry in position 44 be r.r. Its two neighbors must be distinct numbers less than r,r, which can be ordered in (r1)(r2)(r-1)(r-2) ways. Summing over r=1,2,3,4r=1,2,3,4 gives 0+0+2+6=80+0+2+6=8 permutations. By symmetry there are another 88 when 55 is in position 4,4, for a total of 1616 with this comparison pattern. Replacing every entry xx by 6x6-x gives a bijection to the down-up-down-up permutations, so there are another 16.16. The total number of valid rearrangements is 16+16=32.16+16=32. Thus, D is the correct answer.

More practice

Concepts: arrangements with restrictions · bijection

Problem text and solution from the LIVE past-contest archive. See also the AoPS wiki page for community solutions.