When should I multiply and when should I add?

Multiply when stages are sequential and independent—you choose one option from stage 1 AND one from stage 2 AND one from stage 3. Add when choices are mutually exclusive alternatives—pick one category OR another, never both. For example, choosing a shirt (5 options) and pants (3 options) multiplies to 5 \times 3 = 15 outfits. Choosing 'soup or salad' uses Addition: 3 + 2 = 5 appetizers, not 3 \times 2 = 6.

Why do you multiply if the number of options shrinks at each stage?

The Fundamental Counting Principle still applies because each stage represents an independent decision, even if fewer options remain afterward. For example, selecting 2 distinct cards in order from a deck of 52 gives 52 \times 51 = 2652 ordered pairs: 52 choices for the first card, then 4 remaining for the second. You multiply because these are sequential stages, not because the pool size stays constant.

Is the Fundamental Counting Principle the same as permutations or combinations?

The Fundamental Counting Principle is the foundation underlying both. Permutations count ordered arrangements where order matters (apply the principle with decreasing choices: n \times (n-1) \times (n-2) \times \cdots). Combinations count unordered selections where order does not matter (requires a different formula). The principle itself simply counts outcomes from any sequence of choices.

What if one of my stages has only one option?

Multiply as usual. For example, if you must choose a color (3 options) and size (1 option), there are 3 \times 1 = 3 combinations. That stage contributes a factor of 1, which does not change the product—this is often how the Fundamental Counting Principle handles a 'forced' choice where only one path exists.

Fundamental Counting Principle

Multiply the number of choices at each step to find the total number of different possible outcomes when making sequential selections or decisions.

N = n_1 \times n_2 \times \cdots \times n_k

Solve a problem with Fundamental Counting Principle

Type the problem. The solver will use Fundamental Counting Principle where Fundamental Counting Principle is the right tool, and tell you when it is not.

What each symbol means

What Fundamental Counting Principle takes

Symbol	Meaning
$N$	The total number of different outcomes or combinations; it is always a positive integer equal to the product of all stage choices.
$n_i$	The number of options available at the $i$ -th stage or choice (where $i=1$ is first, $i=2$ is second, etc.); must be a non-negative integer.
$k$	The total number of sequential stages or independent choices you make; a positive integer, where $N$ is the product of $k$ factors.

When to use it

Reach for this when you need to count all possible outcomes of a sequence of independent choices.

Level

Usually taught in: Algebra I · Appears on: SAT

Worked examples

1. Choosing an outfit from shirts and pants

Problem

Maya has 3 shirts and 2 pairs of pants. In how many ways can she choose one shirt and one pair of pants to wear?

$n_1 = 3$
The first choice is picking a shirt; there are 3 options available.
$n_2 = 2$
The second choice is picking pants; there are 2 options available.
$N = n_1 imes n_2 = 3 imes 2 = 6$
Apply the Fundamental Counting Principle: multiply the number of choices at each independent stage.

Answer: $N = 6$

Maya makes two independent sequential choices—a shirt and pants. Since each shirt can be paired with any pants, we multiply to count all possible outfits. There are 6 different outfit combinations.

2. Counting license plate possibilities with letters and digits

Problem

A license plate consists of one letter (A–Z) followed by two digits (0–9). How many different license plates are possible?

$n_1 = 26, \quad n_2 = 10, \quad n_3 = 10$
First position has 26 letter choices; second and third positions each have 10 digit choices (0–9).
$N = n_1 imes n_2 imes n_3$
The three positions represent sequential independent choices, so apply the Fundamental Counting Principle.
$10 imes 10 = 100$
First compute the product of the two digit positions: $10 imes 10 = 100$ .
$N = 26 imes 100 = 2600$
Then multiply by the letter choices: $26 imes 100 = 2600$ different possible license plates.

Answer: $N = 2600$

The three plate positions are independent—the letter choice doesn't affect available digits, and digits can repeat. This situation requires multiplying across all three stages. The repetition of digits (both second and third positions can be 0–9) is important: each position independently has the full set of 10 options, so we don't subtract.

3. Assigning supervisors to two construction work sites

Problem

A construction project has two concurrent work sites: the main site and the satellite site. There are 5 supervisors trained for main site work and 4 supervisors trained for satellite site work. The company must assign exactly one supervisor to each site. In how many ways can these assignments be made?

$n_1 = 5$
For the main site, choose one supervisor from 5 trained options.
$n_2 = 4$
For the satellite site, choose one supervisor from 4 trained options.
$N = n_1 imes n_2$
The two assignments to different sites are independent choices, so multiply them using the Fundamental Counting Principle.
$N = 5 imes 4 = 20$
Compute the product: $5 imes 4 = 20$ different supervisor assignments.

Answer: $N = 20$

The construction scenario requires staffing two independent work locations. Each site needs exactly one supervisor, and the supervisor pools are distinct. Since assigning a supervisor to one site does not affect options for the other site, the assignments are independent sequential choices. We multiply the counts to get the total number of staffing configurations.

Common mistakes

Where Fundamental Counting Principle usually goes wrong

The mistake	Why it is wrong	The fix
At a restaurant, you can choose soup (3 options) or salad (2 options), so there are $3 \times 2 = 6$ appetizer options.	The word 'or' indicates these are mutually exclusive choices—you pick one category or the other, not both. The Fundamental Counting Principle applies to sequential 'and' choices, not to 'or' alternatives.	Use the Addition Rule instead: $3 + 2 = 5$ appetizer options total.
A 2-digit PIN uses digits 0–9 in each position, so the total is $10 + 10 = 20$ possible PINs.	With independent sequential choices (first digit AND second digit), you multiply, not add. Adding counts individual digit choices, not digit combinations.	Multiply the choices: $10 \times 10 = 100$ possible 2-digit PINs.
You pick a shirt (5 choices), pants (3 choices), and shoes (4 choices), so the total number of outfits is $5 + 3 + 4 = 12$ .	All three items are chosen independently in sequence (shirt AND pants AND shoes), so you must multiply, not add.	Multiply all stages: $5 \times 3 \times 4 = 60$ outfits.

Tips and when to use something else

Use the Fundamental Counting Principle when making sequential choices that are all independent—each earlier choice doesn't remove an option from the next stage. If choices are mutually exclusive (pick one OR the other, not both), use the Addition Rule instead.
If you are arranging a fixed set of distinct objects (like ordering 3 books from a collection of 5), the Fundamental Counting Principle gives you permutations: the count is $5 \times 4 \times 3$ because options shrink at each stage.
Watch for the language: 'and' between stages means multiply, while 'or' between categories means add. For instance, 'shirt AND pants' multiplies, but 'soup OR salad' adds.
When available options shrink as you progress through stages, you still multiply, not add, because each stage represents an independent decision point even though the pool gets smaller—for example, drawing two cards in order from a deck gives $52 \times 51$ , not $52 + 51$ .

Related formulas

PermutationsPermutations count the number of ways to arrange a set of objects in a specific order, where changing the order creates a different arrangement.CombinationsCombinations count the ways to select items from a group when order doesn't matter; they are used for choosing unordered subsets.Independent EventsWhen events are independent, multiply their individual probabilities together to find the probability that both events occur.Multiplication RuleFind the probability that two events both occur when one might affect the chance of the other using multiplication of probabilities.

Frequently asked questions

When should I multiply and when should I add?: Multiply when stages are sequential and independent—you choose one option from stage 1 AND one from stage 2 AND one from stage 3. Add when choices are mutually exclusive alternatives—pick one category OR another, never both. For example, choosing a shirt (5 options) and pants (3 options) multiplies to $5 \times 3 = 15$ outfits. Choosing 'soup or salad' uses Addition: $3 + 2 = 5$ appetizers, not $3 \times 2 = 6$ .
Why do you multiply if the number of options shrinks at each stage?: The Fundamental Counting Principle still applies because each stage represents an independent decision, even if fewer options remain afterward. For example, selecting 2 distinct cards in order from a deck of 52 gives $52 \times 51 = 2652$ ordered pairs: 52 choices for the first card, then 4 remaining for the second. You multiply because these are sequential stages, not because the pool size stays constant.
Is the Fundamental Counting Principle the same as permutations or combinations?: The Fundamental Counting Principle is the foundation underlying both. Permutations count ordered arrangements where order matters (apply the principle with decreasing choices: $n \times (n-1) \times (n-2) \times \cdots$ ). Combinations count unordered selections where order does not matter (requires a different formula). The principle itself simply counts outcomes from any sequence of choices.
What if one of my stages has only one option?: Multiply as usual. For example, if you must choose a color (3 options) and size (1 option), there are $3 \times 1 = 3$ combinations. That stage contributes a factor of 1, which does not change the product—this is often how the Fundamental Counting Principle handles a 'forced' choice where only one path exists.

Need a different method?

The full solver is not scoped to one formula — type any problem and it will pick the method.

Open the math solver

Reviewed 2026-09-18