10.2: Tree Diagrams and the Multiplication Axiom
In this section you will learn to
- Use trees to count possible outcomes in a multi-step process
- Use the multiplication axiom to count possible outcomes in a multi-step process.
In this chapter, we are trying to develop counting techniques that will be used in the next chapter to study probability. One of the most fundamental of such techniques is called the Multiplication Axiom. Before we introduce the multiplication axiom, we first look at some examples.
If a woman has two blouses and three skirts, how many different outfits consisting of a blouse and a skirt can she wear?
Solution
Suppose we call the blouses \(b_1\) and \(b_2\), and skirts \(s_1\), \(s_2\), and \(s_3\).
We can have the following six outfits.
\[b_1s_1, b_1s_2, b_1s_3, b_2s_1, b_2s_2, b_2s_3 \nonumber \]
Alternatively, we can draw a tree diagram:
The tree diagram gives us all six possibilities. The method involves two steps. First the woman chooses a blouse. She has two choices: blouse one or blouse two. If she chooses blouse one, she has three skirts to match it with; skirt one, skirt two, or skirt three. Similarly if she chooses blouse two, she can match it with each of the three skirts, again. The tree diagram helps us visualize these possibilities.
The reader should note that the process involves two steps. For the first step of choosing a blouse, there are two choices, and for each choice of a blouse, there are three choices of choosing a skirt. So altogether there are \(2 \cdot 3 = 6\) possibilities.
If, in the previous example, we add the shoes to the outfit, we have the following problem.
If a woman has two blouses, three skirts, and two pumps, how many different outfits consisting of a blouse, a skirt, and a pair of pumps can she wear?
Solution
Suppose we call the blouses \(b_1\) and \(b_2\), the skirts \(s_1\), \(s_2\), and \(s_3\), and the pumps \(p_1\), and \(p_2\).
The following tree diagram results.
We count the number of branches in the tree, and see that there are 12 different possibilities.
This time the method involves three steps. First, the woman chooses a blouse. She has two choices: blouse one or blouse two. Now suppose she chooses blouse one. This takes us to step two of the process which consists of choosing a skirt. She has three choices for a skirt, and let us suppose she chooses skirt two. Now that she has chosen a blouse and a skirt, we have moved to the third step of choosing a pair of pumps. Since she has two pairs of pumps, she has two choices for the last step. Let us suppose she chooses pumps two. She has chosen the outfit consisting of blouse one, skirt two, and pumps two, or \(b_1s_2p_2\). By looking at the different branches on the tree, one can easily see the other possibilities.
The important thing to observe here, again, is that this is a three step process. There are two choices for the first step of choosing a blouse. For each choice of a blouse, there are three choices of choosing a skirt, and for each combination of a blouse and a skirt, there are two choices of selecting a pair of pumps.
All in all, we have \(2 \cdot 3 \cdot 2 = 12\) different possibilities.
Tree diagrams help us visualize the different possibilities, but they are not practical when the possibilities are numerous. Besides, we are mostly interested in finding the number of elements in the set and not the actual list of all possibilities; once the problem is envisioned, we can solve it without a tree diagram. The two examples we just solved may have given us a clue to do just that.
Let us now try to solve Example \(\PageIndex{2}\) without a tree diagram. The problem involves three steps: choosing a blouse, choosing a skirt, and choosing a pair of pumps. The number of ways of choosing each are listed below. By multiplying these three numbers we get 12, which is what we got when we did the problem using a tree diagram.
| The number of ways of choosing a blouse | The number of ways of choosing a skirt | The number of ways of choosing pumps |
| 2 | 3 | 2 |
The procedure we just employed is called the multiplication axiom.
If a task can be done in \(m\) ways, and a second task can be done in \(n\) ways, then the operation involving the first task followed by the second can be performed in \(m \cdot n\) ways.
The general multiplication axiom is not limited to just two tasks and can be used for any number of tasks.
A truck license plate consists of a letter followed by four digits. How many such license plates are possible?
Solution
Since there are 26 letters and 10 digits, we have the following choices for each.
| Letter | Digit | Digit | Digit | Digit |
| 26 | 10 | 10 | 10 | 10 |
Therefore, the number of possible license plates is \(26 \cdot 10 \cdot 10 \cdot 10 \cdot 10=260,000\).
In how many different ways can a 3-question true-false test be answered?
Solution
Since there are two choices for each question, we have
| Question 1 | Question 2 | Question 3 |
| 2 | 2 | 2 |
Applying the multiplication axiom, we get \(2 \cdot 2 \cdot 2 = 8\) different ways.
We list all eight possibilities: TTT, TTF, TFT, TFF, FTT, FTF, FFT, FFF
The reader should note that the first letter in each possibility is the answer corresponding to the first question, the second letter corresponds to the answer to the second question, and so on. For example, TFF, says that the answer to the first question is given as true, and the answers to the second and third questions false.
In how many different ways can four people be seated in a row?
Solution
Suppose we put four chairs in a row, and proceed to put four people in these seats.
There are four choices for the first chair we choose. Once a person sits down in that chair, there are only three choices for the second chair, and so on. We list as shown below.
| 4 | 3 | 2 | 1 |
So there are altogether \(4 \cdot 3 \cdot 2 \cdot 1 = 24\) different ways.
How many three-letter word sequences can be formed using the letters { A, B, C } if no letter is to be repeated?
Solution
The problem is very similar to the previous example.
Imagine a child having three building blocks labeled A, B, and C. Suppose he puts these blocks on top of each other to make word sequences. For the first letter he has three choices, namely A, B, or C. Let us suppose he chooses the first letter to be a B, then for the second block which must go on top of the first, he has only two choices: A or C. And for the last letter he has only one choice. We list the choices below.
| 3 | 2 | 1 |
Therefore, 6 different word sequences can be formed.
Finally, we'd like to illustrate this with a tree diagram showing all six possibilities.