7.4 Counting Principles, Permutations, and Combinations

1. Fundamental Counting Principle and Factorial Notation

In many probability problems, determining the size of the sample space by listing out every possible outcome becomes impractical. This is where advanced counting techniques, or combinatorics, are required.

The Fundamental Counting Principle The most basic combinatorics tool is the Fundamental Counting Principle. It states that if one event can occur in $m$ ways, and a second event can occur independently in $n$ ways, then the sequence of the two events can occur in $m \times n$ ways. This can be extended to any number of events. For instance, if a restaurant offers 3 appetizers, 5 main courses, and 2 desserts, the total number of possible three-course meals is $3 \times 5 \times 2 = 30$.

Factorial Notation Before moving to permutations and combinations, one must understand factorial notation, denoted by an exclamation mark (!). The factorial of a positive integer $n$ is the product of all positive integers less than or equal to $n$. So, $5! = 5 \times 4 \times 3 \times 2 \times 1 = 120$. By definition, $0! = 1$. Factorials represent the number of ways to arrange a complete set of $n$ distinct objects into a sequence.

Comparison of Permutations and Combinations

Permutations: When Order Matters A permutation is an arrangement of a specific number of items selected from a larger pool, where the order of selection matters. For example, assigning 1st, 2nd, and 3rd place prizes to a race with 10 competitors, or choosing a president, vice president, and treasurer from a committee. The arrangement (A, B, C) is considered different from (C, B, A).

The formula for calculating the number of permutations of $r$ items taken from a pool of $n$ distinct items is: $_nP_r = \frac{n!}{(n - r)!}$

For the race example (10 runners, top 3 places), $n=10$ and $r=3$: $_{10}P_3 = \frac{10!}{(10 - 3)!} = \frac{10!}{7!} = 10 \times 9 \times 8 = 720$ possible podium arrangements.

Combinations: When Order Does Not Matter A combination is a selection of items from a larger pool where the order of selection does not matter. For example, choosing a subcommittee of 3 members from a board of 10, or selecting 3 pizza toppings from a list of 10. The selection (Cheese, Pepperoni, Onion) is the exact same combination as (Onion, Cheese, Pepperoni).

Because we do not care about the internal arrangement of the selected items, there are fewer combinations than permutations. The formula accounts for this by dividing out the number of ways to arrange the $r$ selected items (which is $r!$). The combination formula is: $_nC_r = \frac{n!}{r!(n - r)!}$

For the subcommittee example (10 members, choosing 3), $n=10$ and $r=3$: $_{10}C_3 = \frac{10!}{3!(10 - 3)!} = \frac{10!}{3! \times 7!} = \frac{10 \times 9 \times 8}{3 \times 2 \times 1} = \frac{720}{6} = 120$ possible subcommittees.

Distinguishing Contextual Word Problems One of the most challenging skills for students is determining whether a word problem requires a permutation or a combination. Teachers must help students focus on the phrase "does order matter?"

• Keywords for Permutations: Arrange, lineup, positions, titles (President, VP), passwords, codes, schedules.
• Keywords for Combinations: Select, choose, group, committee, team, sample, handful.

Probability Using Counting Techniques These counting techniques are directly applied to calculate theoretical probabilities for large sample spaces. To find the probability of a specific event, calculate the number of successful combinations (or permutations) and divide it by the total number of possible combinations (or permutations) in the sample space. For instance, finding the probability of drawing exactly 2 hearts in a 5-card poker hand involves combinations in both the numerator (choosing 2 out of 13 hearts AND 3 out of 39 non-hearts) and the denominator (choosing any 5 out of 52 cards).

2. Permutations, Combinations, and Advanced Probability Models

The study of combinatorics allows us to calculate the size of sample spaces that are too massive to map out with a tree diagram. The Fundamental Counting Principle is the bedrock of this discipline. If a license plate consists of 3 letters followed by 3 numbers, and repetition is allowed, the total number of possible plates is $26 \times 26 \times 26 \times 10 \times 10 \times 10 = 17,576,000$. This principle demonstrates exponential growth in possibilities.

When we introduce permutations and combinations, the critical distinction always comes back to order.

Worked Example: Permutations A club has 12 members. They need to elect a President, a Vice President, and a Secretary. How many different leadership teams can be formed? Analysis: Does order matter? Yes. If Alice is President and Bob is VP, that is a different outcome than Bob being President and Alice being VP. The positions are distinct. Calculation: We are arranging 3 people from a pool of 12. This is a permutation. $_{12}P_3 = \frac{12!}{(12 - 3)!} = \frac{12!}{9!} = 12 \times 11 \times 10 = 1,320$ different leadership teams.

Worked Example: Combinations The same club of 12 members needs to select a committee of 3 people to plan a party. How many different committees can be formed? Analysis: Does order matter? No. A committee of Alice, Bob, and Charlie is the exact same committee as Charlie, Bob, and Alice. There are no distinct roles. Calculation: We are selecting a group of 3 from a pool of 12. This is a combination. $_{12}C_3 = \frac{12!}{3!(12 - 3)!} = \frac{12!}{3! \times 9!} = \frac{12 \times 11 \times 10}{3 \times 2 \times 1} = \frac{1320}{6} = 220$ different committees.

Notice how the number of combinations is significantly smaller than the number of permutations. The division by $3!$ (which is 6) in the combination formula removes all the redundant orderings (ABC, ACB, BAC, BCA, CAB, CBA) that represent the same group.

Applying Combinatorics to Probability We can use these counting techniques to find probabilities. Suppose a box contains 5 red balls and 7 blue balls. If you draw 3 balls at random without replacement, what is the probability that exactly 2 are red? Step 1: Find the total sample space (denominator). We are choosing any 3 balls from the total 12. Order doesn't matter. Total Outcomes = $_{12}C_3 = 220$. Step 2: Find the number of successful outcomes (numerator). We need exactly 2 red balls AND exactly 1 blue ball. We use combinations for each and multiply them (Fundamental Counting Principle). Ways to choose 2 red from 5: $_5C_2 = \frac{5!}{2!3!} = 10$. Ways to choose 1 blue from 7: $_7C_1 = 7$. Successful Outcomes = $10 \times 7 = 70$. Step 3: Calculate Probability. P(2 Red) = 70 / 220 = 7/22, or approximately 31.8%.

Teaching Misconception Scenarios The single biggest misconception is using permutations when combinations are required, or vice versa. Students often latch onto the word "arrange" or "choose" without deeply thinking about the context. Teachers should run activities where students physically act out scenarios. Have three students stand at the front of the class. Assign them titles (President, VP, Sec) and rearrange them to show permutations. Then, take away the titles and declare them a "committee" to show that rearranging them doesn't create a new committee, demonstrating combinations. Another common error is miscalculating factorials by hand or incorrectly entering them into calculators. It is crucial to teach students how to expand factorials algebraically to cancel terms (as shown in the permutation example: $12!/9!$ cancels down to $12 \times 11 \times 10$), which prevents calculation errors and builds number sense.