Counting Methods - ACT Math

SECTION 1

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.

~300 BCE • Early Combinatorics in India

Ancient Indian mathematicians, including Pingala, studied the number of ways to arrange syllables in poetry, laying groundwork for binary combinations and Pascal-like triangle ideas centuries before Europe.

1654 • Pascal & Fermat Correspondence

Blaise Pascal and Pierre de Fermat exchanged letters about gambling problems, formalizing the counting techniques behind probability theory. Pascal's Triangle became a key tool for computing combinations.

1713 • Bernoulli's Ars Conjectandi

Jakob Bernoulli published his landmark treatise, which systematically organized permutations and combinations and connected them to probability, making counting methods a rigorous mathematical discipline.

Modern Era • Counting in the Digital Age

Today, counting methods power computer science, cryptography, and data analysis. Every time your phone generates a password or a website recommends content, combinatorics is working behind the scenes.

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.

SECTION 2

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

If one event can happen in m ways and a second event can happen in n ways, then both events together can happen in m × n ways. This multiplies across any number of stages.

Factorial (n!)

The product of all positive integers from 1 to n. For example, 5! = 5 × 4 × 3 × 2 × 1 = 120. Factorials count the total arrangements of n distinct objects.

Permutations

Arrangements where order matters. Choosing a president, vice president, and secretary from a group is a permutation because switching who gets which role creates a different outcome.

Combinations

Selections where order does NOT matter. Choosing 3 people to form a committee is a combination because the same 3 people make the same committee regardless of the order you pick them.

Addition Principle

If two events are mutually exclusive (they can't happen simultaneously), you add the number of ways each can occur. For example, choosing a red shirt OR a blue shirt means adding the red options to the blue options.

SECTION 3

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.

Each path from Start to a final outcome represents one unique outfit. The three shirt branches each split into two pant branches, yielding 3 × 2 = 6 total outcomes. This is the Fundamental Counting Principle in action.

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.

SECTION 4

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.

FACTORIAL

n! = n × (n − 1) × (n − 2) × … × 2 × 1

n = the number of distinct objects. By definition, 0! = 1. Factorials count the total arrangements of all n items. For example, 4! = 4 × 3 × 2 × 1 = 24.

PERMUTATION

P(n, r) = n! / (n − r)!

n = total items to choose from; r = number of items being arranged. Use this when order matters. Example: arranging 3 out of 8 trophies on a shelf.

COMBINATION

C(n, r) = n! / [r! × (n − r)!]

n = total items; r = items being selected. Use this when order does NOT matter. Notice that C(n, r) = P(n, r) / r!, because dividing by r! removes duplicate orderings.

ℹ

ACT Tip: Permutation vs. Combination

SECTION 5

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.

Start at the top: if the problem has multiple independent stages (e.g., pick a shirt and pick pants), use the Fundamental Counting Principle. If you're selecting from a single group, ask whether order matters to choose between permutations and combinations.

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

Common ACT counting scenarios and which method to use

SECTION 6

Worked Example

Let's walk through a typical ACT-style problem step by step.

Worked example

1
Step 1 — Read the Problem

A club has 12 members. They need to choose a president, a vice president, and a secretary. How many different ways can these 3 positions be filled?
2
Step 2 — Determine the Method

The three positions are distinct roles. If Amy is president and Ben is vice president, that's different from Ben being president and Amy being vice president. Since order matters and we are selecting 3 from 12, this is a permutation.

Use P(n, r) where n = 12, r = 3
3
Step 3 — Apply the Formula

P(12, 3) = 12! / (12 − 3)! = 12! / 9!. Rather than computing full factorials, notice that most terms cancel: 12! / 9! = 12 × 11 × 10 (everything below 10 cancels with 9!).

12 × 11 × 10
4
Step 4 — Calculate

12 × 11 = 132. Then 132 × 10 = 1,320.

P(12, 3) = 1,320 ways
5
Step 5 — Verify with Counting Principle

As a check, think of it stage by stage: 12 choices for president, then 11 remaining for vice president, then 10 remaining for secretary. That gives 12 × 11 × 10 = 1,320 ✓. Both approaches agree.

★

Key takeaway

SHORTCUT CHECK

SECTION 7

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

Permutation vs. Combination comparison

★

Key takeaway

THE PIZZA TOPPING TEST

SECTION 8

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

How counting methods connect to probability and beyond

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.

ℹ

Looking Ahead

SECTION 9

Practice Problems

Question 1: CONCEPTUAL

Which of the following best explains why C(8, 3) is less than P(8, 3), and what dividing by r! removes from the count?

A. Dividing by r! removes the duplicate groups that arise because C(8, 3) only selects 3 items while P(8, 3) selects more items, making the pool smaller.
B. Dividing by r! removes the repeated arrangements of the same group of items, since every group of 3 items can be ordered in 3! = 6 ways, and order does not matter in a combination.
C. Dividing by r! removes items that were counted more than once because some items appear in multiple groups of 3, reducing double-counted elements.
D. Dividing by r! removes the arrangements in which items are repeated, since permutations allow repeated items but combinations do not.
E. Dividing by r! adjusts for the fact that P(8, 3) counts groups of different sizes, while C(8, 3) restricts all groups to exactly 3 items.

Show answer

Step 1: Compute P(8, 3) = 8 × 7 × 6 = 336. This counts every ordered arrangement of 3 items chosen from 8, so the selection {A, B, C} is counted separately from {B, A, C}, {C, A, B}, {A, C, B}, {B, C, A}, and {C, B, A}. Step 2: For any single group of 3 distinct items, there are 3! = 3 × 2 × 1 = 6 different orderings. Each of those 6 orderings is a separate entry in P(8, 3). Step 3: Because combinations ask only 'which items are chosen' (not the order), all 6 orderings of the same group should collapse into a single count. Dividing by r! = 3! = 6 removes those duplicate arrangements. Step 4: C(8, 3) = P(8, 3) / 3! = 336 / 6 = 56. Step 5: Therefore C(8, 3) = 56 < 336 = P(8, 3), and what dividing by r! removes is the repeated arrangements of the same group — exactly what choice B states. Distractor analysis: A is incorrect because both formulas select the same number of items (3). C confuses item repetition across groups with ordering. D incorrectly attributes the difference to repeated items rather than repeated orderings. E incorrectly claims P(8, 3) counts groups of varying sizes. Correct answer: B

Question 2: BASIC CALCULATION

A restaurant offers 4 appetizers, 6 entrees, and 3 desserts. If a customer orders one of each, how many different meals are possible?

A. 13
B. 36
C. 72
D. 144
E. 216

Show answer

This is a multi-stage problem with three independent choices, so the Fundamental Counting Principle applies. Multiply the number of options at each stage: 4 × 6 × 3 = 72. There are 72 different possible meals. Each stage is independent — the appetizer choice doesn't affect the entree options — which is exactly when you multiply. Common errors: adding instead of multiplying gives 4 + 6 + 3 = 13 (choice A); multiplying only two categories gives 4 × 6 = 24 or 6 × 3 = 18 or 4 × 3 = 12, none of which appear here; forgetting one category and multiplying the other two gives 6 × 6 = 36 (choice B); doubling the correct answer gives 144 (choice D); computing 6³ = 216 (choice E) confuses the number of entrees for all category counts.

Question 3: INTERMEDIATE

From a class of 15 students, the teacher must choose a team of 4 students to represent the class at a competition. How many different teams can be formed?

A. 56
B. 455
C. 1,365
D. 2,730
E. 32,760

Show answer

Since the 4 students form a team with no specific roles (order doesn't matter), use the combination formula: C(15, 4) = 15! / [4! × (15 − 4)!] = 15! / (4! × 11!). Cancel the 11! in the numerator and denominator to get (15 × 14 × 13 × 12) / (4 × 3 × 2 × 1). The numerator is 32,760 and the denominator is 24, so C(15, 4) = 32,760 / 24 = 1,365. The correct answer is C. Distractor rationale: A (56) = C(8,3), a miscounting with wrong values; B (455) = C(15,3), using a group of 3 instead of 4; D (2,730) results from dividing 32,760 by 12 instead of 24, a partial division error; E (32,760) is the numerator 15 × 14 × 13 × 12 before dividing by 4!, mistaking a permutation for a combination.

Question 4: APPLIED

A student council has 10 members. They need to elect a president, a vice president, and a treasurer, and then separately form a 3-person prom committee (no one can serve on both). How many ways can all positions and the committee be filled?

F. 720
G. 4,200
H. 25,200
J. 50,400
K. 75,600

Show answer

Break this into two stages. First, fill the 3 officer positions from 10 members. Since the roles are distinct (president, vice president, treasurer), use a permutation: P(10, 3) = 10 × 9 × 8 = 720 ways. After 3 officers are chosen, 7 members remain. The prom committee is a group with no ranked roles, so use a combination: C(7, 3) = 7! / (3! × 4!) = (7 × 6 × 5) / (3 × 2 × 1) = 35. Since the officer election AND the committee selection both must happen, multiply the results: 720 × 35 = 25,200. The correct answer is H. Distractor notes: F (720) counts only the officer permutation and ignores the committee entirely. G (4,200) uses C(10,3) × C(7,3) = 120 × 35 = 4,200, which incorrectly treats the three officer roles as unranked — since president, vice president, and treasurer are distinct roles, order matters and a permutation P(10,3) = 720 (not combination C(10,3) = 120) must be used; the correct product is 720 × 35 = 25,200, not 4,200. J (50,400) doubles the correct answer, arriving at 25,200 × 2 = 50,400 by mistakenly applying a permutation to the prom committee as if its 3 seats were also ranked, giving C(7,3) × 3! = 35 × 6 = 210 instead of 35, and 720 × 210 = 151,200 is not even 50,400 — more likely this distractor comes from erroneously multiplying 25,200 × 2. K (75,600) applies an extra incorrect factor of 3 to the correct product, computing 25,200 × 3 = 75,600.

Question 5: CRITICAL THINKING

A 5-character password consists of 3 distinct letters (chosen from A–Z) followed by 2 distinct digits (chosen from 0–9). The order of the letters matters and the order of the digits matters (e.g., ABС12 and BAС12 are different passwords). How many such passwords are possible?

A. 1,757,600
B. 11,881,376
C. 1,404,000
D. 1,560,000
E. 140,400

Show answer

Because the password has distinct positional slots (1st letter, 2nd letter, 3rd letter, 1st digit, 2nd digit), order matters — this is a permutation problem, not a combination problem. Step 1: Count the ordered ways to fill the 3 letter positions with distinct letters (order matters). The 1st letter has 26 choices, the 2nd has 25, and the 3rd has 24: 26 × 25 × 24 = 15,600. Step 2: Count the ordered ways to fill the 2 digit positions with distinct digits (order matters). The 1st digit has 10 choices and the 2nd has 9: 10 × 9 = 90. Step 3: Multiply the two results together: 15,600 × 90 = 1,404,000. The correct answer is C.