Chapter 4: Probability

4-4 Counting Methods in Probability

Counting methods are essential tools in probability, allowing us to determine the number of possible outcomes in various scenarios. This section introduces five foundational counting rules used in statistics and probability.

Multiplication Counting Rule

• Definition: If a sequence of events occurs, where the first event can happen in n1 ways, the second in n2 ways, and so on, the total number of outcomes is the product of the possibilities for each event.

• Formula:

• Example: If a password consists of 5 characters and each character can be any of 92 possible symbols, the total number of passwords is .

• Application: The probability of guessing the correct password on the first try is .

Factorial Rule

• Definition: The number of different arrangements (where order matters) of n different items is n! (n factorial).

• Notation: ; by definition, .

• Example: The word "steam" has 5 letters. The number of ways to arrange these letters is .

• Probability Application: The probability that the letters are arranged in alphabetical order is .

Permutations and Combinations: Does Order Count?

• Permutations: Arrangements where order matters. For example, "abc" and "cab" are different permutations.

• Combinations: Arrangements where order does not matter. For example, "abc" and "cab" are the same combination.

• Mnemonic: "Permutations Position" (order matters); "Combinations Committee" (order does not matter).

Permutations Rule (All Items Different)

• Definition: The number of ways to arrange r items selected from n different items (without replacement, order matters) is:

• Formula:

• Example: In a horse race with 20 horses, the number of possible trifecta bets (selecting 3 horses in order) is .

• Probability Application: The probability of selecting the exact winning order is .

Permutations Rule (Some Items Identical)

• Definition: When some items are identical, the number of unique permutations is:

• Formula: , where are the counts of identical items.

• Example: For a survey with 10 questions, where 2 are identical and 3 others are identical, the number of arrangements is .

Combinations Rule

• Definition: The number of ways to select r items from n different items (without replacement, order does not matter) is:

• Formula:

• Example: In a lottery where 5 numbers are chosen from 35, the number of possible tickets is .

• Probability Application: The probability of winning with one ticket is .

Summary Table: Counting Rules

Applications and Importance

• Counting rules are foundational for calculating probabilities in real-world scenarios such as lotteries, password security, survey design, and betting.

• Understanding when order matters (permutations) versus when it does not (combinations) is crucial for correct probability calculations.