Introduction to Permutations
In combinatorics, a permutation is an ordered arrangement of objects. If you have $n$ distinct items and you want to choose $r$ of them and arrange them in a specific sequence, the number of ways to do this is denoted as $P(n, r)$ or $_nP_r$.
The Logical Derivation
To understand the formula $P(n, r) = \frac{n!}{(n-r)!}$, let's visualize $r$ empty slots that need to be filled by $n$ available objects.
- First Slot: You have $n$ choices.
- Second Slot: Since one object is already placed, you have $(n-1)$ choices.
- Third Slot: You have $(n-2)$ choices.
- $r$-th Slot: Following the pattern, for the $r$-th slot, you will have $(n - (r - 1)) = (n - r + 1)$ choices.
By the Fundamental Counting Principle, the total number of ways is the product of these choices: $$P(n, r) = n \times (n - 1) \times (n - 2) \times \dots \times (n - r + 1)$$
Transforming to Factorial Notation
To simplify this into a compact formula, we use factorials ($n! = n \times (n-1) \times \dots \times 1$). We multiply and divide our expression by the remaining sequence: $(n-r) \times (n-r-1) \times \dots \times 1$, which is $(n-r)!$.
$$P(n, r) = \frac{n \times (n - 1) \times \dots \times (n - r + 1) \times [(n - r) \times (n - r - 1) \times \dots \times 1]}{(n - r) \times (n - r - 1) \times \dots \times 1}$$
The numerator becomes $n!$ and the denominator is $(n-r)!$. Thus: $$P(n, r) = \frac{n!}{(n - r)!}$$
Key Takeaways
- Permutations care about order.
- $n!$ represents the total arrangements of all $n$ items.
- Dividing by $(n-r)!$ 'cancels out' the arrangements of the items we did not choose.