Permutations: Arrangements Without Repetition
What You'll Learn
You'll learn how to count the number of ways to arrange distinct objects in a specific order using the permutation formula.
Understanding Ordered Arrangements
Imagine you have 5 different books and want to arrange 3 of them on a shelf. How many different arrangements are possible? This is a permutation problem—you're selecting and ordering items from a larger set, where each item can only be used once.
A permutation is an ordered arrangement of objects chosen from a set of distinct items, without repetition. The key word is ordered: putting Book A, then B, then C is different from putting Book C, then B, then A.
The Permutation Formula
To count permutations, we use:
P(n, r) = n! / (n - r)!
Where:
n= total number of distinct objects availabler= number of positions to fill!= factorial (multiply all positive integers up to that number)
How It Works
Think step-by-step:
- For the first position: you have
nchoices - For the second position: you have
n - 1choices (one already used) - For the third position: you have
n - 2choices - Continue for
rpositions total
This gives us: n × (n-1) × (n-2) × ... × (n-r+1)
The formula n!/(n-r)! is just a compact way to write this multiplication.
Example
For our 5 books arranged 3 at a time:
- P(5, 3) = 5! / (5-3)! = 5! / 2! = 120 / 2 = 60 arrangements
Key Takeaway: Permutations count ordered arrangements of r distinct objects selected from n total objects, calculated as n!/(n-r)!, where order matters and repetition is not allowed.