This could just as well go into MPSIMS, but this has factual answers and a GQ attached to it.
The following problem was forwarded to me. How does one go about solving it:
http://hilltop.bradley.edu/~delgado/potw/p195.html
I’m not going to use spoilers, so if anyone want to try solving the problem on their own without my influence, please don’t read on.
Usually with combination and permutation problems, I start with smaller sets and try to find a pattern that develops. I write set of 1, 2, 3, 4, 5 and then extrapolate up to the number I need, because I can never remember the formulas, since I don’t use them all that often.
Anyhow, according to the rules of the problem, each chart must be unique, songs cannot climb the charts once they’ve fallen, and I assume this means any given song can stay in the same position, as long as there is movement elsewhere in the chart.
With 1 item, I have one possibilty satisfying the parameters: A
With 2 there’s two: AB and BA
With 3 there’s four: ABC, BAC, BCA, CBA
With 4 there’s seven: ABCD, BACD, BCAD, CBAD, CBDA, CDBA, DCBA
With 5, I found 11 (won’t list them all.)
If this pattern extends to 20, there should be 191 charts that satisfy the requirements.
Of course, there is much that can go wrong with my intuitive approach. I may have missed some chart sequences that satisfy the problem’s requirements. Perhaps the pattern doesn’t follow the rule I’m applying to it. Thirdly, there must be some mathematical way of arriving at the answer, but I can’t see it.
My solution seems very sloppy, but for a quick back-of-the-envelope guess, I don’t think it’s too shabby.
So what is the answer, and what is the method?