Counting Principles, Permutations, and Combinations in College Algebra

Counting Principles

Fundamental Counting Principle

The Fundamental Counting Principle is a basic rule in combinatorics used to determine the total number of possible outcomes when there are multiple choices or events. If there are several independent choices to make, the total number of outcomes is the product of the number of options for each choice.

• Definition: If there are m possible choices for one event and n possible choices for another event, then there are m × n total possible outcomes for both events.

• Formula: $\text{Total outcomes} = m_1 \times m_2 \times \cdots \times m_k$ where $m_1, m_2, \ldots, m_k$ are the number of choices for each event.

• Example: If you have 3 shirts and 4 pants, the number of possible outfits is $3 \times 4 = 12$.

Applications of the Counting Principle

• Multiple Events: For more than two events, multiply the number of options for each event.

• Example: A menu lists 4 appetizers and 6 entrees. The number of possible meals with both is $4 \times 6 = 24$.

• Dice Rolls: Rolling 5 dice, each with 6 sides: $6^5 = 7776$ possible outcomes.

• License Plates: For plates with 3 letters (A-Z) and 3 numbers (0-9): $26^3 \times 10^3 = 17,576,000$ options.

• Phone Numbers: For 10-digit numbers where the 1st and 4th digits can't be 0: $9 \times 10 \times 10 \times 9 \times 10^6$ possible numbers.

Permutations

Definition and Properties

Permutations are arrangements of objects in a specific order. Each arrangement is unique, and order matters. Permutations are used when selecting or arranging items where the sequence is important.

• Key Point: Use permutations when order matters and each object is used only once.

• Example: The different ways to wear 5 shirts over 5 days are permutations, as the order of shirts matters.

Permutation Formula

• Formula: The number of permutations of r objects out of n total objects is: $P(n, r) = \frac{n!}{(n - r)!}$ where $n!$ is the factorial of $n$.

• Example: Choosing a line leader and a door holder from 25 students: $P(25, 2) = \frac{25!}{23!}$

• Practice: Evaluate $P(8, 6)$.

Permutations of Distinct and Non-Distinct Objects

• Distinct Objects: All objects are different. $P(n, r) = \frac{n!}{(n - r)!}$

• Non-Distinct Objects: Some objects are identical. $\text{Number of permutations} = \frac{n!}{n_1! n_2! \cdots 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!}$

Combinations

Definition and Properties

Combinations are selections of objects where order does not matter. Combinations are used when the arrangement is not important, only the group itself.

• Key Point: Use combinations when order does not matter and each object is used only once.

• Example: Selecting 2 flavors out of 32 for a milkshake: $C(32, 2)$

Combination Formula

• Formula: The number of combinations of r objects out of n total objects is: $C(n, r) = \frac{n!}{r!(n - r)!}$

• Example: Number of ways to select 4 students from 28: $C(28, 4) = \frac{28!}{4!24!}$

• Practice: Evaluate $C(11, 7)$.

Permutations vs. Combinations

Comparison Table

Permutations and combinations are both methods for counting arrangements, but they differ in whether order matters.

Type	Order Matters?	Formula	Example
Permutations	Yes	$P(n, r) = \frac{n!}{(n - r)!}$	Arranging books on a shelf
Combinations	No	$C(n, r) = \frac{n!}{r!(n - r)!}$	Selecting team members

Identifying Permutations and Combinations

• Permutation: Arranging objects, order is important.

• Combination: Selecting objects, order is not important.

• Example: How many different teams of 4 can be formed from 9 people? Combination

• Example: How many ways can a photographer line up 5 family members? Permutation

Summary of Key Formulas

• Fundamental Counting Principle: $m_1 \times m_2 \times \cdots \times m_k$

• Permutation (distinct): $P(n, r) = \frac{n!}{(n - r)!}$

• Permutation (non-distinct): $\frac{n!}{n_1! n_2! \cdots n_k!}$

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

Practice and Applications

• Calculate the number of possible outcomes for rolling multiple dice, creating license plates, or phone numbers using the counting principle.

• Use permutation formulas for arranging objects in order, including cases with identical items.

• Apply combination formulas for selecting groups where order does not matter.

Additional info: These notes cover foundational topics in College Algebra related to counting, permutations, and combinations, which are essential for probability and discrete mathematics.