Basic Counting Principles

The multiplication principle

Start with the lunch, but shrink it so we can see everything. Say there are $2$ sandwiches, ham and veg, and $3$ drinks, tea, milk, and juice. A tree diagram lays out the choices in stages. Draw one branch for each sandwich, then from the end of every sandwich branch draw one branch for each drink. Each path from left to right makes one complete lunch, and the tips on the far right are all the lunches there are.

The tree makes the count easy to see. There are $2$ sandwich branches, and each one sprouts the same $3$ drink branches, so the tips come in $2$ equal groups of $3$. That is $3 + 3 = 6$ tips, and counting equal groups is exactly what multiplication does, so $2 \times 3 = 6$ lunches. This is the multiplication principle, also called the fundamental counting principle. Whenever a stage offers the same number of choices next, no matter which earlier choices were made, multiply the stage counts.

Trees, lists, and grids

A tree is one way to organize a count. Two others are worth keeping in your toolkit, because they let you verify a count by hand. Reading the tree’s tips from top to bottom, in a fixed order, gives an organized list of every outcome. That order holds the sandwich and runs through the drinks before moving to the next sandwich. Listing in a fixed order is what keeps you from skipping an outcome or counting one twice.

A grid shows the same count as a rectangle. Put the sandwiches down the side and the drinks across the top, and each cell is one lunch. A rectangle with $2$ rows of $3$ cells holds $2 \times 3 = 6$ cells. That is the multiplication principle in picture form, since the area of a rectangle is rows times columns.

Three or more stages

The principle does not stop at two stages. Suppose you make a third choice that still offers the same number of options no matter what came before. Every existing outcome then splits again, once for each new option, so you multiply by the third stage’s count too.

In general, this holds whenever every stage offers the same number of choices no matter what came before. Then the number of ways to complete the sequence is the product of the choices at each stage:

The reasoning is the same each time. Adding one more stage with $k$ choices replaces every outcome so far with $k$ versions of it, which multiplies the running total by $k$.

The addition principle

Not every problem is a sequence of choices. Sometimes you make a single choice, picking one item from one of several separate groups. When the groups do not overlap, you add their sizes instead of multiplying.

Suppose a prize shelf holds $5$ books and $3$ board games, and you take exactly one item home. Your prize is either a book or a game, never both at once. Because no item belongs to both groups, you can slide the two groups together into one pile of $5 + 3 = 8$ items. Choosing one prize is then just choosing one item from that pile. So there are $8$ possible prizes. This is the addition principle. If you choose one item from groups that share no members, the number of choices is the sum of the group sizes.

The contrast with the multiplication principle is the entire point, so hold the two side by side. A sequence of choices, “this and then that,” multiplies, because each first choice opens up a fresh set of second choices. A single choice from separate groups, “this or that,” adds, because the groups sit beside each other and you land in only one of them. The numbers can be identical while the answers differ: $5$ and $3$ give $5 \times 3 = 15$ for one book and one game. But $5 + 3 = 8$ is the count for one prize that is a book or a game.

Counting arrangements stage by stage

A special kind of counting asks in how many orders a set of items can be placed. Take $3$ different books, A, B, and C, that you want to line up on a shelf. Treat each shelf position as a stage. For the first position you may use any of the $3$ books. Once that book is placed it is used up, so only $2$ books remain for the second position. After that, just $1$ book remains for the third. The choices shrink at each stage, and by the multiplication principle you multiply them:

Written out, those six orders are ABC, ACB, BAC, BCA, CAB, and CBA: every way to line up three different books.

This is not a new rule. It is the multiplication principle applied to stages whose choice counts shrink by one each time. The counts shrink because each item you place is no longer available for the next position. You do not always fill every position from the whole set, either. If you only want the first few places in order, just multiply the shrinking counts for as many stages as you fill, and stop.

Repeated choices and exponents

When the same number of choices repeats at every stage, the product becomes a power, which connects counting straight back to exponents. Flip a coin and there are $2$ outcomes, heads or tails. Flip it again and each of those splits into $2$, giving $2 \times 2 = 4$. Flip it a third time and you reach $2 \times 2 \times 2 = 8$. For $n$ flips you multiply $n$ twos:

The exponent counts how many stages there are, and the base counts the choices at each stage. The same shape appears whenever choices repeat. A $4$-digit code, where each digit can be any of the $10$ digits $0$ through $9$ and a digit may repeat, has

possible values, which is why a $4$-digit PIN has exactly ten thousand settings. Watch the order of the base and the exponent: $2^n$ (two choices, $n$ times) and $n^2$ ($n$ choices, twice) are different counts. So keep straight which number is the choices and which is the number of stages.

Counting the equally likely possibilities

These rules matter beyond menus and medals: they answer how many results an experiment like rolling dice or drawing cards has, without listing every one. When those results are all equally likely, that total is exactly what the next lesson, on probability, needs.

Common mistakes