2021 AMC 10A Problem 20
Problem 20 of 25HarderCounting & Probability
In how many ways can the sequence 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 must be in position or position If it is in position let the entry in position be Its two neighbors must be distinct numbers less than which can be ordered in ways. Summing over gives permutations. By symmetry there are another when is in position for a total of with this comparison pattern.
Replacing every entry by gives a bijection to the down-up-down-up permutations, so there are another
The total number of valid rearrangements is
Thus, D is the correct answer.