Historical Context & Motivation
Humans have been counting and organizing objects for thousands of years, but the formal mathematics of counting methods — also called combinatorics — developed more recently. The need to count the number of possible outcomes in games of chance, arrange soldiers in formations, and compute odds drove mathematicians to create systematic techniques. These methods let you answer questions like "How many different ways can I arrange my schedule?" without listing every single possibility.
The central question these methods address is deceptively simple: How many ways can something happen? Whether it's choosing a committee, arranging books on a shelf, or selecting answers on a test, counting methods give you efficient formulas so you never have to list every option by hand. On the ACT, you'll encounter these problems in the "Preparing for Higher Math" section, and knowing when to multiply, when to use permutations, and when to use combinations is the key to solving them quickly.
Core Principles & Definitions
All counting methods rest on a small set of foundational ideas. Once you understand these core principles, every counting problem on the ACT becomes a matter of identifying which principle applies and plugging in numbers.
Fundamental Counting Principle
Factorial (n!)
Permutations
Combinations
Addition Principle
Visual Explanation — The Counting Principle Tree
A tree diagram is one of the most intuitive ways to visualize the Fundamental Counting Principle. Each branch represents a choice at a particular stage, and the total number of paths from start to finish equals the total number of outcomes. The diagram below shows the outcomes when choosing from 3 shirts and 2 pants.
Notice that you don't have to draw the entire tree for large problems. The tree just illustrates why multiplication works: every branch at stage one pairs with every branch at stage two. If there were also 4 shoe choices, you'd simply extend: 3 × 2 × 4 = 24. On the ACT, recognizing the multi-stage structure of a problem lets you jump straight to multiplication without drawing anything.
Mathematical Framework
The three main formulas you need for ACT counting problems are the factorial, the permutation formula, and the combination formula. Each one builds on the previous, so learn them in order.
Detailed Breakdown — Choosing the Right Method
The hardest part of ACT counting problems isn't the arithmetic — it's deciding which method to use. The flowchart below walks you through the decision process step by step. Start at the top, answer each question, and follow the arrow to the correct formula.
| Scenario | Order Matters? | Method | Formula |
|---|---|---|---|
| Arrange ALL 5 books on a shelf | Yes | Factorial | 5! = 120 |
| Choose 1st, 2nd, 3rd place from 10 runners | Yes | Permutation | P(10, 3) = 720 |
| Pick 3 students for a committee from 10 | No | Combination | C(10, 3) = 120 |
| Choose an entree, a drink, and a dessert | N/A (multi-stage) | Counting Principle | m × n × p |
| Create a 4-digit PIN (digits 0–9, repeats OK) | Yes | Counting Principle | 10 × 10 × 10 × 10 = 10,000 |
Worked Example
Let's walk through a typical ACT-style problem step by step.
Permutations vs. Combinations — Side by Side
The single most common mistake on ACT counting problems is mixing up permutations and combinations. The table below puts them side by side so you can see exactly how they differ and when to use each.
| Feature | Permutation P(n, r) | Combination C(n, r) |
|---|---|---|
| Order | Matters — ABC ≠ BAC | Does NOT matter — {A, B, C} = {B, A, C} |
| Formula | n! / (n − r)! | n! / [r! × (n − r)!] |
| Result size | Always ≥ the combination | Always ≤ the permutation |
| Relationship | P(n, r) = C(n, r) × r! | C(n, r) = P(n, r) / r! |
| Key words | Arrange, order, rank, assign, sequence, password | Choose, select, committee, group, team, hand (cards) |
| Example | Gold, Silver, Bronze medals from 8 athletes: P(8, 3) = 336 | Pick 3 athletes for a team from 8: C(8, 3) = 56 |
Connections to Probability & Advanced Topics
Counting methods are not just stand-alone topics — they are the foundation of probability. On the ACT, you may see problems that ask for the probability of an event, which requires you to count favorable outcomes and divide by total outcomes. Understanding counting methods makes these probability questions much more manageable.
| Counting Methods (This Lesson) | Probability & Advanced Topics |
|---|---|
| Count total outcomes using formulas | Use total outcomes as the denominator in P(event) = favorable / total |
| Fundamental Counting Principle for multi-stage events | Independent probability: P(A and B) = P(A) × P(B) |
| Combinations C(n, r) for groups | Binomial probability uses C(n, r) × p^r × (1 − p)^(n−r) |
| Addition principle for OR scenarios | P(A or B) = P(A) + P(B) − P(A and B) |
| Factorial for arranging all items | Derangements, circular permutations in advanced combinatorics |
On the ACT specifically, a typical probability-counting hybrid might ask: "A bag contains 5 red and 7 blue marbles. If you draw 3 marbles, what is the probability that all 3 are red?" To solve this, you'd compute C(5, 3) for the favorable outcomes and C(12, 3) for the total outcomes, then divide. The counting tools you learned in this lesson make that calculation straightforward.