Q.In how many ways can 10 examination papers be arranged so that the best and the worst papers never come together?
A) 9×8! B) 8×8! C) 9×9! D) 8×9!

When all $n$ objects available are distinct (no two are alike) and repetition is NOT allowed, the number of ways to arrange $r$ of them (where $r\le n$) in a definite order is denoted ${}^nP_r$ and is given by ${}^nP_r = n\times(n-1)\times(n-2)\times\cdots\times(n-r+1) = \dfrac{n!}{(n-r)!}$. The reasoning behind the formula is a direct application of the Multiplication Principle: the first of the $r$ positions can be filled in $n$ ways (any of the $n$ objects); having used one object, the second position can be filled in only $n-1$ ways (one fewer object remains); the third in $n-2$ ways; and so on, until the $r$-th position, which can be filled in $n-(r-1)$ ways since $r-1$ objects have already been used. Multiplying these $r$ shrinking counts together gives the formula. A special case worth remembering is $r=n$: arranging ALL $n$ distinct objects gives ${}^nP_n = n!$ (using the convention $0!=1$). This formula, and the theorems built on top of it — such as th …