Counting Principles: Permutations, Combinations, and Applications in Statistics

Counting Principles in Statistics

Introduction to Permutations

Permutations are a fundamental concept in statistics and combinatorics, used to count the number of ways to arrange a set of objects where order matters. This topic is essential for understanding probability and data analysis involving arrangements.

• Permutation: An arrangement of objects in a specific order. Each arrangement is unique based on the sequence.

• Key Formula: The number of permutations of n objects taken r at a time is given by: $P(n, r) = \frac{n!}{(n - r)!}$

• Example: If you have 8 shirts and want to choose 5 to wear in order, the number of ways is: $8 \times 7 \times 6 \times 5 \times 4 = 6,720$

• Application: Arranging students for roles, filling blanks in a quiz, or organizing objects where order is important.

Permutations of Non-Distinct Objects

Sometimes, objects to be arranged are not all unique. In such cases, we use permutations of non-distinct objects, which account for repeated items.

• Permutations of Distinct Objects: All objects are different. $n!$

• Permutations of Non-Distinct Objects: Some objects are identical. The formula is: $\frac{n!}{n_1! \times n_2! \times \cdots \times n_k!}$ where $n_1, n_2, \ldots, n_k$ are the counts of each type of identical object.

• Example: Arranging the letters in "BANANA": $\frac{6!}{3!2!1!} = 60$

Permutations vs. Combinations

Permutations and combinations are two ways to count arrangements, but they differ in whether order matters.

Permutations	Combinations
Order matters	Order does not matter
Used for arranging objects	Used for grouping objects
$P(n, r) = \frac{n!}{(n - r)!}$	$C(n, r) = \frac{n!}{r!(n - r)!}$

• Example: Choosing 2 students from 5 for president and vice president (permutation), versus choosing 2 students to be on a committee (combination).

Combinations

Combinations count the number of ways to select objects from a group where order does not matter. This is crucial in probability and sampling.

• Combination Formula: $C(n, r) = \frac{n!}{r!(n - r)!}$

• Example: Number of ways to select 4 people from a group of 8: $C(8, 4) = \frac{8!}{4!4!} = 70$

• Application: Selecting teams, committees, or lottery numbers.

Applications in Probability

Counting principles are directly applied in probability calculations, such as determining the likelihood of winning a lottery or forming groups.

• Probability Formula using Combinations: $P(\text{event}) = \frac{\text{number of favorable outcomes}}{\text{total number of outcomes}}$

• Example: Probability of winning a lottery by choosing 5 numbers from 40: $C(40, 5) = \frac{40!}{5!35!}$

Practice Problems

• Permutations: How many ways to elect a president, vice president, and treasurer from 13 members? $13 \times 12 \times 11 = 1,716$

• Combinations: How many ways to select 4 students from 28 to lead a discussion? $C(28, 4) = 20,475$

• Non-Distinct Objects: Arranging the letters in "CALCULUS": $\frac{8!}{2!2!2!1!1!} = 5040$ Additional info: The formula divides by the factorial of each repeated letter's count.

Summary Table: Key Counting Formulas

Type	Formula	Order Matters?	Example
Permutation (distinct)	$P(n, r) = \frac{n!}{(n - r)!}$	Yes	Arranging 5 shirts from 8
Permutation (non-distinct)	$\frac{n!}{n_1! n_2! \cdots n_k!}$	Yes	Arranging "BANANA"
Combination	$C(n, r) = \frac{n!}{r!(n - r)!}$	No	Selecting 4 students from 28

Additional info:

• Counting principles are foundational for probability, sampling, and inferential statistics.

• Always check if order matters to choose the correct formula.

• Factorials ($n!$) represent the product of all positive integers up to $n$.