Permutations (Ordered Sampling Without Replacement)
An ordered set is a set where the order of the elements matter. Without replacement means that you can’t pick the same element more than once.
Theory
Permutations
When you draw elements from a set of elements, you call the number of possible orders the permutations.
Note! The order of the drawn elements matters!
Example 1
15 teams are joining a relay race.
- 1.
- How many different ways can the teams place first through third?
- 2.
- Messi, Bale and Ronaldo each run for their team. What’s the probability that Bale’s team wins, Messi’s team comes in second, and Ronaldo’s team comes in third?
- 1.
- Since it matters whether you come in first, second or third place, the order matters. That means you can think of the different ways to distribute the places as permutations. The calculation becomes
That means there are 2730 different ways to fill the three first places when there are 15 teams.
- 2.
- Since the placement is decided, “Bale, Messi and Ronaldo” is one event out of the possible options. You calculate and get:
Example 2
You’re electing 4 students for the student council from a group of 31 people: One president, one vice president, one secretary and one treasurer.
- 1.
- How many different councils can there be, when you take who gets which position into account?
- 2.
- Al Gore is in the group. What is the probability that he is elected to the student council?
- 1.
- Since it matters who has the different positions, you can think of this as a case where the order matters. That means each possible student council is a permutation. There are 31 students that can be chosen for president, 30 for vice president, and so on. Because you pick 4 council members out of the group, you find the number of different councils like this:
That means you can elect different student councils.
- 2.
- Al Gore is one of the 31 students, so if you assume that there’s an equal possibility for everyone to be elected, you calculate that:
