01 / 20

Counting
Methods

Master permutations, combinations, and the fundamental counting principle to solve arrangement and selection problems on the ACT.

ACT Math

What Are Counting Methods?

Counting methods are systematic techniques for determining how many ways something can happen without listing every possibility. They answer questions like: "How many outfits can I make?" or "How many ways can a committee be formed?"

Counting Principle
Multiply choices at each step together
Permutations
Order matters: arrangements of objects
Combinations
Order does not matter: selections of objects

The Fundamental Counting Principle

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

Shirts Pants Outfits Red Blue White Jeans Khakis 6
\(3 \text{ shirts} \times 2 \text{ pants} = 6 \text{ outfits}\)
Each shirt pairs with each pair of pants

Understanding Factorials: \(n!\)

The factorial of a positive integer \(n\), written \(n!\), is the product of all positive integers from \(1\) to \(n\). Factorials are the building blocks of permutation and combination formulas.

\(4! = 24\)
\(4 \times 3 \times 2 \times 1\)
\(6! = 720\)
\(6 \times 5 \times 4 \times 3 \times 2 \times 1\)
\(0! = 1\)
By definition (special case)

Permutations: Order Matters

A permutation counts the number of ways to arrange \(r\) objects chosen from a set of \(n\) objects, where the order matters.

Arrange 3 letters from {A, B, C, D} 4 choices × 3 choices × 2 choices
\(P(4, 3) = 4 \times 3 \times 2 = 24 \text{ arrangements}\)

Think of it as filling slots: each time you place an object, you have one fewer choice for the next slot.

Combinations: Order Does Not Matter

A combination counts the number of ways to select \(r\) objects from a set of \(n\) objects, where the order does not matter.

Since order doesn't matter, we divide the permutation count by \(r!\) to remove duplicate arrangements of the same group.

Permutation vs. Combination

Permutation Combination
Order Matters Does NOT matter
Formula \(\frac{n!}{(n-r)!}\) \(\frac{n!}{r!(n-r)!}\)
Keyword clues Arrange, rank, order, lineup Choose, select, committee, group
Result size Larger Smaller (divides by \(r!\))
Example President, VP, Secretary 3-person committee

How to Apply Counting Methods

1
Identify the task. Are you arranging objects (order matters) or selecting a group (order doesn't matter)?
2
Count the total pool. Determine \(n\): how many objects are available to choose from?
3
Count the selection size. Determine \(r\): how many objects are being chosen or placed?
4
Choose the formula. Use \(P(n,r)\) for arrangements, \(C(n,r)\) for selections, or the counting principle for multi-step events.
5
Compute and simplify. Cancel factorial terms before multiplying to keep numbers manageable.

Example 1: Counting Principle

A restaurant offers 4 appetizers, 6 entrees, and 3 desserts. How many different three-course meals can be ordered?

Appetizer 4 × Entree 6 × Dessert 3
\(= 72 \text{ different meals}\)

Example 2: Permutation

A club with 12 members needs to elect a President, Vice President, and Treasurer. How many ways can these positions be filled?

1
Identify: \(n = 12\) members, \(r = 3\) positions
2
Apply: \(P(12, 3) = \frac{12!}{(12-3)!} = \frac{12!}{9!}\)
3
Simplify: \(12 \times 11 \times 10 = \) 1,320 ways

Example 3: Combination

From a deck of 52 cards, how many different 5-card hands can be dealt?

1
Identify: \(n = 52\) cards, \(r = 5\) selections
2
Apply: \(C(52, 5) = \frac{52!}{5!\,\cdot\,47!}\)
3
Simplify: \(\frac{52 \times 51 \times 50 \times 49 \times 48}{5 \times 4 \times 3 \times 2 \times 1} = \) 2,598,960 hands

Example 4: Multi-Step Counting

A team of 3 boys and 2 girls is chosen from 8 boys and 6 girls. How many different teams can be formed?

Choose 3 boys from 8
\(C(8, 3) = 56\)
× Choose 2 girls from 6
\(C(6, 2) = 15\)
\(56 \times 15 = 840 \text{ teams}\)

Special Cases to Know

Arranging All
Arranging all \(n\) objects: \(P(n,n) = n!\). Arranging 5 books on a shelf: \(5! = 120\).
Choose Everything
\(C(n, n) = 1\) and \(C(n, 0) = 1\). There is exactly 1 way to choose all or none.
Symmetry
\(C(n, r) = C(n, n-r)\). Choosing 2 from 10 is the same count as choosing 8 from 10.
With Repetition
If items repeat, divide by duplicate factorials: arrangements of "MISS" = \(\frac{4!}{2!} = 12\).

Common Mistakes to Avoid

✕ Wrong Formula
Using a permutation when order doesn't matter (or vice versa). Always ask: "Does rearranging change the outcome?"
✕ Forgetting to Divide
Getting the permutation answer and stopping: you must divide by \(r!\) for combinations.
✕ Overcounting Duplicates
Not dividing by duplicate factorials when items are identical (e.g., letters in "MISSISSIPPI").

Summary of Counting Methods

Method Formula When to Use
Counting Principle \(m \times n \times \ldots\) Multi-step independent events
Permutation \(\frac{n!}{(n-r)!}\) Arrangements where order matters
Combination \(\frac{n!}{r!(n-r)!}\) Selections where order doesn't matter
All items \(n!\) Arrange every object in a set
With repeats \(\frac{n!}{a!\,b!\,\ldots}\) Identical items present

Question 1 of 5

A lock code consists of 3 digits chosen from 0 through 9, where digits may repeat. How many possible codes are there?

Question 2 of 5

How many ways can a president, vice president, and secretary be chosen from a group of 10 people?

Question 3 of 5

A pizza shop offers 8 toppings. You choose 3 toppings for your pizza. How many different pizzas can you create?

Question 4 of 5

How many distinct ways can the letters in the word "LEVEL" be arranged?

Question 5 of 5

A team of 2 men and 3 women must be formed from 5 men and 7 women. How many different teams are possible?