01 / 20

Apply Counting
Principles

Use counting techniques like the Fundamental Counting Principle, permutations, and combinations to determine the number of possible outcomes.

PRAXIS Core Math (5733)

Why Counting Matters

Many problems ask: "How many ways can this happen?" Rather than listing every possibility by hand, counting principles let you find the total quickly and reliably.

The Fundamental Counting Principle

If one event can occur in \( m \) ways and a second independent event can occur in \( n \) ways, then the two events can occur together in \( m \times n \) ways.

Choosing a Shirt then Pants Shirt A Shirt B Shirt C Pants 1 Pants 2
\( 3 \times 2 \)
\( = 6 \)
outfits

Multiply the Choices

When you make a sequence of independent choices, multiply the number of options at each step:

Example: A meal has \( 4 \) appetizers, \( 5 \) entrees, and \( 3 \) desserts. The number of distinct meals is \( 4 \times 5 \times 3 = 60 \).

Factorials: Ordering Everything

A factorial counts the number of ways to arrange all items in order. The symbol is "!".

Arranging \( 5 \) books on a shelf: \( 5! = 5 \times 4 \times 3 \times 2 \times 1 = 120 \) ways.

Permutations: Order Matters

A permutation counts arrangements of \( r \) items chosen from \( n \), where order matters (1st, 2nd, 3rd are different).

Example: Awarding gold, silver, and bronze to \( 8 \) runners: \( {}_8P_3 = \dfrac{8!}{5!} = 8 \times 7 \times 6 = 336 \).

Combinations: Order Doesn't Matter

A combination counts selections of \( r \) items from \( n \), where order does not matter (a group is the same no matter how it's listed).

Example: Choosing a \( 3 \)-person committee from \( 8 \) people: \( {}_8C_3 = \dfrac{8!}{3!\,5!} = 56 \).

Permutation vs. Combination

The key question: Does order matter? If swapping two items creates a new outcome, use a permutation. If not, use a combination.

Permutation
Order matters. Examples: rankings, race finishes, passwords, seating in a row.
Combination
Order doesn't matter. Examples: committees, lottery picks, choosing toppings.

A Step-by-Step Approach

1
Identify the task. Are you making a sequence of choices, arranging, or selecting?
2
Ask: does order matter? Yes → permutation. No → combination.
3
Find \( n \) and \( r \). \( n \) = total available; \( r \) = how many you pick.
4
Apply the formula and compute, simplifying factorials carefully.

Example 1: License Plates

A plate has \( 3 \) letters followed by \( 3 \) digits, repeats allowed. How many plates are possible?

Key idea: repeats allowed means the count stays the same at every slot of that type.

Example 2: Race Medals

In a race of \( 10 \) runners, in how many ways can the gold, silver, and bronze medals be awarded?

There are 720 different ways to award the three medals.

Example 3: Pizza Toppings

A pizza shop offers \( 7 \) toppings. How many ways can you choose \( 3 \) different toppings?

There are 35 different topping combinations.

Common Mistakes

✕ Confusing P and C
Using a permutation when order doesn't matter (or vice versa). Always ask the order question first.
✕ Adding Instead of Multiplying
For a sequence of choices, multiply the options. Add only when choosing one path OR another.
✕ Forgetting Repeats
If items can repeat, the count doesn't drop each step. Read whether repetition is allowed.
✕ Misusing \( 0! \)
Remember \( 0! = 1 \), not \( 0 \). This matters when \( n = r \) in a permutation.

Summary Reference

Permutation Combination
Order matters?YesNo
Formula\( \dfrac{n!}{(n-r)!} \)\( \dfrac{n!}{r!\,(n-r)!} \)
Typical useRankings, codesGroups, selections
Result sizeLargerSmaller

Question 1 of 5

A diner offers \( 3 \) soups, \( 4 \) sandwiches, and \( 2 \) drinks. How many different soup-sandwich-drink meals are possible?

Question 2 of 5

In how many ways can \( 6 \) students line up in a single row?

Question 3 of 5

A club must elect a president and a vice-president from \( 9 \) members. How many ways can these two distinct offices be filled?

Question 4 of 5

A teacher chooses \( 2 \) students from a group of \( 6 \) to represent the class. How many different pairs are possible?

Question 5 of 5

A \( 4 \)-digit PIN uses digits \( 0 \) through \( 9 \), and digits may repeat. How many PINs are possible?

You Can Count On It

1
Sequence of choices? Multiply options at each step.
2
Order matters? Use a permutation \( {}_nP_r \).
3
Order doesn't matter? Use a combination \( {}_nC_r \).