Permutations and combinations are counting methods that help you find how many outcomes are possible without listing every case. They are useful in probability, games, passwords, schedules, genetics, and many other situations where choices can be arranged or grouped. The key question is whether order matters, because arranging the same items in a different order may or may not create a new outcome.
Factorials give a compact way to count long chains of choices.
Understanding Math: Permutations and Combinations
A reliable way to decide which method fits is to name one outcome clearly. Suppose three students are picked from eight for a presentation. If one student is the speaker, one controls slides, and one answers questions, swapping two names changes the assignment.
The positions make the result different. If the same three students are simply chosen to attend a workshop, swapping their names changes nothing. This small wording test prevents many errors.
Look for ranks, seats, roles, time slots, codes, or routes. These usually make order important.
Look for groups, selections, hands of cards, or committees. These usually treat the chosen members as one set.
Factorials work because each choice reduces the number of items left. Imagine arranging five different books on a shelf. There are five choices for the first space.
After that, four books remain for the next space, then three, then two, then one. Multiplying these choice counts gives the total number of arrangements. For a shorter ordered list, stop after filling the required number of places.
Formula methods often use factorials because they package this repeated multiplication neatly. When simplifying a factorial calculation, expand only enough terms to see which factors cancel. The value of zero factorial is one because there is exactly one way to arrange no objects, namely to leave the arrangement empty.
Many real situations need extra care before any calculation begins. A password rule may allow repeated characters, so a character used first can still be used later. The usual no-repeat permutation method would not fit.
A seating problem may include two identical chairs, which do not create new arrangements when swapped. A card problem may have restrictions, such as choosing exactly two hearts. In these cases, break the task into stages.
Count the allowed choices for each stage, then multiply when each completed choice from one stage can pair with every allowed choice from the next. If cases cannot overlap, count each case separately and add the results. Drawing a simple tree for a small version can reveal the correct structure.
Combinations are especially important in probability because many events are groups rather than ordered sequences. A five-card hand is one hand regardless of the order in which the cards were dealt. To find a probability, count the favorable groups and compare them with all possible groups under the same rules.
The two counts must use the same idea of outcome. Do not count favorable results as ordered lists while counting all results as unordered groups. Another common mistake is to divide by too much.
An ordered selection counts every group many times, once for each possible internal order. Dividing by the number of those orders removes the duplicates and leaves each group counted once. Checking a tiny example with three or four objects is a strong way to catch this mistake before using large numbers.
Key Facts
- Factorial: n! = n(n - 1)(n - 2)...(1), and 0! = 1
- Permutation of n items taken r at a time: P(n, r) = n!/(n - r)!
- Combination of n items taken r at a time: C(n, r) = n!/(r!(n - r)!)
- Use permutations when order matters, such as 1st, 2nd, and 3rd place winners.
- Use combinations when order does not matter, such as choosing a team or committee.
- Connection: P(n, r) = C(n, r) r!, because each group of r items can be arranged in r! orders.
Vocabulary
- Permutation
- A selection and arrangement of items where order matters.
- Combination
- A selection of items where order does not matter.
- Factorial
- The product of a positive integer and all smaller positive integers, with 0! defined as 1.
- Sample space
- The set of all possible outcomes in a counting or probability problem.
- Repetition
- A rule that tells whether an item can be chosen more than once.
Common Mistakes to Avoid
- Using a permutation when order does not matter. This overcounts because the same group is counted once for every possible ordering.
- Using a combination when order matters. This undercounts because different arrangements, such as ABC and BAC, should be treated as different outcomes.
- Forgetting the factorial in the denominator of C(n, r). The r! removes duplicate orderings of the same selected group.
- Assuming repetition is allowed without checking the problem. The formulas P(n, r) = n!/(n - r)! and C(n, r) = n!/(r!(n - r)!) apply when items are chosen without replacement.
Practice Questions
- 1 A race has 8 runners. How many ways can gold, silver, and bronze medals be awarded if no runner can win more than one medal?
- 2 A club has 12 members. How many different 4 person committees can be chosen?
- 3 A teacher chooses 3 students from a class to stand in a line for a demonstration. Explain whether this situation should be counted with a permutation or a combination, and why.