Browse · harp
Printimc
counting and probability intermediate
Problem
In how many ways can the sequence be rearranged so that no three consecutive terms are increasing and no three consecutive terms are decreasing?
(A)
(B)
(C)
(D)
Solution
We write out the cases, then filter out the valid ones: We count these out and get permutations that work.
Final answer
D