Counting
Methods
Master permutations, combinations, and the fundamental counting principle to solve arrangement and selection problems on the ACT.
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?"
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.
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.
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.
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
Example 1: Counting Principle
A restaurant offers 4 appetizers, 6 entrees, and 3 desserts. How many different three-course meals can be ordered?
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?
Example 3: Combination
From a deck of 52 cards, how many different 5-card hands can be dealt?
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?
Special Cases to Know
Common Mistakes to Avoid
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?