Permutations of n Objects Taken r at a Time
What you'll learn: You'll master the formula for counting arrangements when you select only some objects from a larger collection.
The Core Idea
In the previous lesson, you learned to count all possible arrangements of n distinct objects: n! ways. But what if you don't want to arrange all the objects? What if you're choosing and arranging only r objects from your n available objects?
For example: You have 10 different books but only 3 spots on a shelf. How many ways can you select and arrange 3 books from the 10?
This is called a permutation of n objects taken r at a time, denoted P(n,r) or sometimes ₙPᵣ.
Deriving the Formula
Think step-by-step through the selection process:
- For the first position: you have n choices
- For the second position: you have (n-1) remaining choices
- For the third position: you have (n-2) remaining choices
- Continue until the r-th position: you have (n-r+1) choices
Multiplying these together:
P(n,r) = n × (n-1) × (n-2) × ... × (n-r+1)
This is the first r factors of n!. We can write it more compactly using factorials:
P(n,r) = n!/(n-r)!
Why? Because n! = n × (n-1) × ... × (n-r+1) × (n-r) × ... × 1, and dividing by (n-r)! cancels out everything after the r-th term.
Example
P(10,3) = 10!/(10-3)! = 10!/7! = 10 × 9 × 8 = 720 ways to arrange 3 books from 10.
Key Takeaway: When selecting and arranging r objects from n distinct objects, use P(n,r) = n!/(n-r)! to count the permutations; order matters, and you're only using some of the available objects.