If you have $n$ CDs to arrange sequentially on a shelf, say for $1 \le n \le 20$, how many ways can they be ordered? Please also explain the solution steps.
Tell me more
×
Mathematics Stack Exchange is a question and answer site for
people studying math at any level and professionals in related fields. It's 100% free, no registration required.
|
|
|||||
|
|
There are $n!$ ways of ordering them, where the exclamation mark represents factorial, which itself is a special case of the gamma function. The reasoning is that you have $n$ choices for the first (assume leftmost) object. Then for the next, there are $n-1$ choices remaining, and so on, until in the last place, there is only one choice. By a counting principle from combinatorics (sometimes called the rule of product or fundamental rule of counting), the total number of ways is then the product $$ (n)\cdot(n-1)\cdots3\cdot2\cdot1=n! $$ This process is also called sampling without replacement (with ordering), but usually in the context of sampling, the order of draws is unimportant, and only the resulting set of objects drawn (without regard to order) is significant. And when all objects are drawn and order is significant, the process of assigning an order to each object (or reassigning orders starting from an arbitrary numbering of them) is also equivalent to defining a permutation of the objects. |
||||
|
|
|
This is just a straight forward permutation of objects. Think about choosing them in some order. First you have $n$ objects to choose from, then $n - 1$ then $n - 2$ and so on. Thus $n!$ is your solution. |
|||
|
|
