Skip to main content
Statistics LibreTexts

3.3: Counting and Compound Events

  • Page ID
    41779
  • \( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

    \( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)

    \( \newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\)

    ( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\)

    \( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)

    \( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\)

    \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)

    \( \newcommand{\Span}{\mathrm{span}}\)

    \( \newcommand{\id}{\mathrm{id}}\)

    \( \newcommand{\Span}{\mathrm{span}}\)

    \( \newcommand{\kernel}{\mathrm{null}\,}\)

    \( \newcommand{\range}{\mathrm{range}\,}\)

    \( \newcommand{\RealPart}{\mathrm{Re}}\)

    \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)

    \( \newcommand{\Argument}{\mathrm{Arg}}\)

    \( \newcommand{\norm}[1]{\| #1 \|}\)

    \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)

    \( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\AA}{\unicode[.8,0]{x212B}}\)

    \( \newcommand{\vectorA}[1]{\vec{#1}}      % arrow\)

    \( \newcommand{\vectorAt}[1]{\vec{\text{#1}}}      % arrow\)

    \( \newcommand{\vectorB}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

    \( \newcommand{\vectorC}[1]{\textbf{#1}} \)

    \( \newcommand{\vectorD}[1]{\overrightarrow{#1}} \)

    \( \newcommand{\vectorDt}[1]{\overrightarrow{\text{#1}}} \)

    \( \newcommand{\vectE}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash{\mathbf {#1}}}} \)

    \( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

    \( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)

    \(\newcommand{\avec}{\mathbf a}\) \(\newcommand{\bvec}{\mathbf b}\) \(\newcommand{\cvec}{\mathbf c}\) \(\newcommand{\dvec}{\mathbf d}\) \(\newcommand{\dtil}{\widetilde{\mathbf d}}\) \(\newcommand{\evec}{\mathbf e}\) \(\newcommand{\fvec}{\mathbf f}\) \(\newcommand{\nvec}{\mathbf n}\) \(\newcommand{\pvec}{\mathbf p}\) \(\newcommand{\qvec}{\mathbf q}\) \(\newcommand{\svec}{\mathbf s}\) \(\newcommand{\tvec}{\mathbf t}\) \(\newcommand{\uvec}{\mathbf u}\) \(\newcommand{\vvec}{\mathbf v}\) \(\newcommand{\wvec}{\mathbf w}\) \(\newcommand{\xvec}{\mathbf x}\) \(\newcommand{\yvec}{\mathbf y}\) \(\newcommand{\zvec}{\mathbf z}\) \(\newcommand{\rvec}{\mathbf r}\) \(\newcommand{\mvec}{\mathbf m}\) \(\newcommand{\zerovec}{\mathbf 0}\) \(\newcommand{\onevec}{\mathbf 1}\) \(\newcommand{\real}{\mathbb R}\) \(\newcommand{\twovec}[2]{\left[\begin{array}{r}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\ctwovec}[2]{\left[\begin{array}{c}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\threevec}[3]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\cthreevec}[3]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\fourvec}[4]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\cfourvec}[4]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\fivevec}[5]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\cfivevec}[5]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\mattwo}[4]{\left[\begin{array}{rr}#1 \amp #2 \\ #3 \amp #4 \\ \end{array}\right]}\) \(\newcommand{\laspan}[1]{\text{Span}\{#1\}}\) \(\newcommand{\bcal}{\cal B}\) \(\newcommand{\ccal}{\cal C}\) \(\newcommand{\scal}{\cal S}\) \(\newcommand{\wcal}{\cal W}\) \(\newcommand{\ecal}{\cal E}\) \(\newcommand{\coords}[2]{\left\{#1\right\}_{#2}}\) \(\newcommand{\gray}[1]{\color{gray}{#1}}\) \(\newcommand{\lgray}[1]{\color{lightgray}{#1}}\) \(\newcommand{\rank}{\operatorname{rank}}\) \(\newcommand{\row}{\text{Row}}\) \(\newcommand{\col}{\text{Col}}\) \(\renewcommand{\row}{\text{Row}}\) \(\newcommand{\nul}{\text{Nul}}\) \(\newcommand{\var}{\text{Var}}\) \(\newcommand{\corr}{\text{corr}}\) \(\newcommand{\len}[1]{\left|#1\right|}\) \(\newcommand{\bbar}{\overline{\bvec}}\) \(\newcommand{\bhat}{\widehat{\bvec}}\) \(\newcommand{\bperp}{\bvec^\perp}\) \(\newcommand{\xhat}{\widehat{\xvec}}\) \(\newcommand{\vhat}{\widehat{\vvec}}\) \(\newcommand{\uhat}{\widehat{\uvec}}\) \(\newcommand{\what}{\widehat{\wvec}}\) \(\newcommand{\Sighat}{\widehat{\Sigma}}\) \(\newcommand{\lt}{<}\) \(\newcommand{\gt}{>}\) \(\newcommand{\amp}{&}\) \(\definecolor{fillinmathshade}{gray}{0.9}\)
    Learning Objectives
    • Recognize distinct cases when counting
    • Define compound events
    • Understanding events using "or", "and", and "given"
    • Develop and use the Addition Rule for counting the number of possible outcomes
    • Develop and use a Multiplication Rule for counting the number of possible outcomes with compound events viewed sequentially
    • Count the number of possible outcomes for various compound events

    Counting: Distinct Cases

    Recall Text Exercise \(3.2.1.\)b, where we were drawing two tiles in sequence without replacement from a bag consisting of \(3\) red, \(2\) white, and \(1\) blue tiles. We produced our sample space by constructing a tree diagram (reproduced below).


    TreeDiagramTwoTileSelection.png

    Figure \(\PageIndex{1}\): Tree diagram of tile combinations

    This tree diagram looks different from most of the tree diagrams from the previous section; two branches end with three options, but the bottom branch only has two options. The situation and the count differed based on which branch we initially started. We had to consider two cases: case \(1\) of blue initially drawn and case \(2\) of red/white initially drawn. Either case \(1\) or case \(2\) must happen because an initial tile must be drawn, but note that both cases are exclusive. If case \(1\) happens, blue is the only option for the initial draw, and then there are two options for the second tile, making our count for case \(1\) is \(1\cdot2\) \(=2.\) If case \(2\) happens, there are two options for the initial draw and three options for the second draw, making our count for case \(2\) \(2\cdot3\) \(=6.\) We have \(1 \cdot 2\) \(+ 2 \cdot 3\) \(= 8 \) possible outcomes in the sample space between the two cases.

    Here is a more challenging example. Suppose a committee of ten must be formed from a group of twenty hourly employees and five managers. How many different committees can be formed if at least three managers must be on the committee? We must think carefully about how the committee is formed to count correctly. The phrase "at least three managers" tells us our selected group can have three managers or, four managers or, five managers on the committee. The committee size remains at \(10\) regardless of the number of managers. We can construct a table to determine the different committee compositions at the manager and hourly employee levels.\begin{array}{|c|c|c|c|} \hline \text{Committee Total} &10&10&10 \\ \hline \text{Number of Managers} &3&4&5 \\ \hline \text{Number of Hourly Employees} &10-3=7&10-4=6&10-5=5 \\ \hline \nonumber \end{array}

    Each column of the table represents a particular committee. We recognize these committee compositions as distinct cases, one of which must happen. To count the total number of committees, we count the number of committees in each case and add them together.

    \[ \nonumber \text{total number of committees}=\\ \text{number of committees with three managers}+ \text{number of committees with four managers} + \text{number of committees with five managers} \]Each case is similar in the fact that both managers and hourly employees must be selected. Our multiplication rule applies nicely since we have each group of hourly workers for each group of managers. We proceed case by case.

    If the number of managers is \(3,\) we must choose \(3\) of the \(5\) managers, order of selection does not matter, yielding \( \sideset{_{5}}{_{3}}C \) different possibilities for filling the manager positions. The remaining \(7\) committee members will be chosen from the \(20\) hourly employees, yielding \( \sideset{_{20}}{_{7}}C \) different possibilities (again, we use combinations since order does not matter). Our multiplication rule informs us that there are \( \sideset{_{5}}{_{3}}C\cdot \sideset{_{20}}{_{7}}C\) \(= 10 \cdot 77,520\) \(= 775,200\) committees possible in which three of the members are managers.

    Similarly for the other two cases, there are \( \sideset{_{5}}{_{4}}C\cdot \sideset{_{20}}{_{6}}C\) \(= 5 \cdot 38,760\) \(= 193,800 \) possibilities with four managers and \( \sideset{_{5}}{_{5}}C\cdot \sideset{_{20}}{_{5}}C\) \(= 1 \cdot 15,504\) \(= 15,504 \) possibilities with five managers.\[ \begin{align*}\text{number of committees with three managers}+ &\text{number of committees with four managers} + \text{number of committees with five managers} \\&= \sideset{_{5}}{_{3}}C\cdot \sideset{_{20}}{_{7}}C + \sideset{_{5}}{_{4}}C\cdot \sideset{_{20}}{_{6}}C + \sideset{_{5}}{_{5}}C\cdot \sideset{_{20}}{_{5}}C\\&= 775,200 + 193,800 + 15,504 \\ &=984,504 \end{align*}\]There are \(984,504\) possible committees that fit this description. From this work, we can also form some probability claims. If a committee is randomly formed given these restrictions, the probability that the committee will have five managers as members will be \( \frac{15,504}{984,504}\) \(\approx 1.5748\%\) and the probability that the committee will have three managers as members will be \( \frac{775,200}{984,504}\) \(\approx 78.7402\%.\)

    Text Exercise \(\PageIndex{1}\)
    1. A food truck makes tacos with at least one but up to five fillings from eight ingredients: beef, fish, pork, beans, cheese, lettuce, tomatoes, and guacamole. How many ways can a taco be ordered from the food truck vendor?
    Answer

    We notice that we are given restrictions on the taco fillings. We must choose at least one filling for a taco while having at most five fillings. There are several distinct cases to consider, with only one taking place.

    • One filling chosen
    • Two fillings chosen
    • Three fillings chosen
    • Four fillings chosen
    • Five fillings chosen

    These are the only possible choices satisfying the requirements. We can determine the counts for each of these five cases and add those counts to find the total number of possibilities. Using our earlier reasoning that each of these five cases is a combination count (order of filling choices does not matter.)\[ \nonumber \text{# of one filling}+ \text{# of two fillings} + \text{# of three fillings} + \text{# of four fillings} + \text{# of five fillings}\] \[ \nonumber \sideset{_{8}}{_{1}}C+ \sideset{_{8}}{_{2}}C + \sideset{_{8}}{_{3}}C + \sideset{_{8}}{_{4}}C + \sideset{_{8}}{_{5}}C\] \[ \nonumber 8+28+56+70+56\] \[\nonumber 218 \]A customer has \(218\) possible tacos that could be ordered. No wonder it takes some customers so long to decide what to eat.

    1. A ten-person committee to investigate possible corruption in U.S. military contracts is to be formed among the \(59\) members of the House of Representatives Armed Services Committee and the \(25\) members of the Senate Committee on Armed Services. The committee must have at least five House members and at least two senators. How many committees are possible?
    Answer

    We notice that we are given restrictions on the committee structure. We must have at least five house members while still having at least two senators on the committee of ten. We have several distinct cases to consider, with only one taking place.

    • Five House members and five Senators
    • Six House members and four Senators
    • Seven House members and three Senators
    • Eight House members and two Senators

    These are the only four possible committee structures satisfying the requirements. We can determine the counts for each of these four cases and sum those counts to find the total number of possible committees. We use similar reasoning to compute: \[ \nonumber \sideset{_{59}}{_{5}}C\cdot \sideset{_{25}}{_{5}}C + \sideset{_{59}}{_{6}}C\cdot \sideset{_{25}}{_{4}}C + \sideset{_{59}}{_{7}}C\cdot \sideset{_{25}}{_{3}}C + \sideset{_{59}}{_{8}}C\cdot \sideset{_{25}}{_{2}}C\] \[ \nonumber 2.66 \times 10^{11} + 5.70 \times 10^{11} + 7.85 \times 10^{11} + 6.65 \times 10^{11}\] \[\nonumber 2.29 \times 10^{12} \]There are about \(2,290,000,000,000\) committees that could be formed: an astounding number of possibilities. We are glad we only had to determine the number of possible committees and were not required to list the options by constructing a tree diagram.

    Multiple counting strategies come into play as we explore possible outcomes. Counting can be pretty complicated. We are on the verge of a formal addition rule that will come in handy; we will formulate it within the context of compound events.

    Connecting Events Using "or", "and", and "given"

    When describing multiple events, we typically use one of the following: \(A\) or \(B,\) or \(A\) and \(B.\) Using multiple events to describe or form another event is called a compound event.

    Consider rolling a single fair die. The sample space is the set: \(\{1,\) \(2,\) \(3,\) \(4,\) \(5,\) \(6\}.\)

    The compound event \(\small{\text{ODD}}\) involves three outcomes: \(1,\) \(3,\) and \(5.\) We understand the event \(\small{\text{ODD}}\) to occur if when we roll the die, either a \(1,\) \(3,\) or \(5\) lands face up; there are three ways for our compound event to occur. Since the die is fair, we can compute the probability using the classical method: \(P\left(\small{\text{ODD}}\right)\) \(=\frac{3}{6}\) \(=\frac{1}{2}.\) The complement of \(\small{\text{ODD}}\) consists of the outcomes \(2,\) \(4,\) and \(6\) which we note is the compound event \(\small{\text{EVEN}};\) so, \(\overline{\small{\text{ODD}}}\) \(=\small{\text{EVEN}}.\)

    The compound event \(\small{\text{PERFECT }}\)\(\small{\text{SQUARE}}\) involves just two outcomes: \(1\) and \(4.\) \(P(\small{\text{PERFECT }}\)\(\small{\text{SQUARE}})\) \(=\frac{2}{6}\) \(=\frac{1}{3}.\)

    Consider the compound event \(A\) \(= \small{\text{EVEN}}\)\(\normalsize{\text{ or }}\)\( \small{\text{PERFECT }}\)\(\small{\text{SQUARE}}.\) We refer to a single compound event \(A\) using two events connected with the word "or." We understand event \(A\) to occur if, when we roll the die, either \(\small{\text{EVEN}}\) occurs or \(\small{\text{PERFECT SQUARE}}\) occurs. Meaning, if \(1,\) \(2,\) \(4,\) or \(6\) land face up, \(A\) occurs. \(P\left(A\right)\) \(=P(\small{\text{EVEN}}\)\(\normalsize{\text{ or }}\)\( \small{\text{PERFECT }}\)\(\small{\text{SQUARE}})\) \(=\frac{4}{6}\) \(=\frac{2}{3}.\)

    Side note: there are different ways to consider "or". Since we include the possibility that both \(A\) and \(B\) occur, our use of the word "or" is called inclusive. If we excluded the possibility that both events occur simultaneously, the word "or" would be called exclusive. Whenever we use the word "or" in this text, we are using it inclusively.

    In our last example, notice that the outcome \(4\) was described by both \(\small{\text{EVEN}}\) and \(\small{\text{PERFECT }}\)\(\small{\text{SQUARE}}.\) When two events have outcomes in common, the events are not mutually exclusive.

    Consider the compound event \(B\) \(= \small{\text{EVEN}}\)\(\normalsize{\text{ and }}\)\( \small{\text{PERFECT }}\)\(\small{\text{SQUARE}}.\) We are again referring to a single compound event \(B\) using two events; this time, the two events are connected with the word "and". We understand event \(B\) to occur if, when we roll the die, both \(\small{\text{EVEN}}\) and \(\small{\text{PERFECT SQUARE}}\) occur; meaning \(B\) will occur only when \(4\) lands face up. So, \(P\left(B\right)\) \(=P(\small{\text{EVEN}}\)\(\normalsize{\text{ and }}\)\( \small{\text{PERFECT }}\)\(\small{\text{SQUARE}})\) \(=\frac{1}{6}.\)

    For a final example, consider the event \(\small{\text{EVEN}}\)\(\normalsize{\text{ given }}\)\( \small{\text{PERFECT }}\)\(\small{\text{SQUARE}}\) which is often denoted \(\small{\text{EVEN}}|\small{\text{PERFECT }}\)\(\small{\text{SQUARE}}.\) For a third time, we refer to a single event, say event \(C,\) using two events connected with the word "given." When we use "given," we treat our situation as if we had additional knowledge about what is happening; that is, we assume that the die roll is guaranteed, having a probability of \(1,\) to be a perfect square and are considering the likelihood, given this assumption, that it is even. We treat our situation conditionally by restricting our sample space to the event that follows the word "given." When examining the conditional event \(\small{\text{EVEN}}\)\(\normalsize{\text{ given }}\)\( \small{\text{PERFECT }}\)\(\small{\text{SQUARE}}\), we do not consider the original sample space of \(\{1,\) \(2,\) \(3,\) \(4,\) \(5,\) \(6\}.\) Instead, we only consider the perfect squares from that conditional sample space: \(1\) and \(4.\) We have a "new" conditional sample space of size \(2.\) We then ask, how many of these \(2\) possibilities satisfy the event \(\small{\text{EVEN}}\)? There is only one possibility of an even, \(4.\) Now in computing the probability, we must remember that we only considered the outcomes in the event \(\small{\text{PERFECT }}\)\(\small{\text{SQUARE}};\) so the total number of outcomes is not \(6\) but \(2.\) \(P(\small{\text{EVEN}}|\small{\text{PERFECT }}\)\(\small{\text{SQUARE}})\) \(=\frac{1}{2}.\)

    Text Exercise \(\PageIndex{2}\)

    Consider rolling two fair dice in sequence and the events below. For each event, identify the possible outcomes described and compute the probability.

    OutcomesPairDice.png

    Figure \(\PageIndex{2}\): Sample space of rolling two standard dice

    1. Event: \(\small{\text{SUM }}\)\(\small{\text{OF }}\)\(\small{\text{THE }}\)\(\small{\text{TWO }}\)\(\small{\text{VALUES }}\)\(\small{\text{IS }}\normalsize7\)
    Answer

    The sum of the values will be \(7\) for the following pairs: \(1\) and \(6,\) \(2\) and \(5,\) \(3\) and \(4,\) \(6\) and \(1,\) \(5\) and \(2,\) and \(4\) and \(3.\) We have \(P(\small{\text{SUM }}\)\(\small{\text{OF }}\)\(\small{\text{THE }}\)\(\small{\text{TWO }}\)\(\small{\text{VALUES }}\)\(\small{\text{IS }}\normalsize7)\) \(=\frac{6}{36}\) \(=\frac{1}{6}.\) Notice all these outcomes fall on the diagonal from bottom left to top right.

    1. Event: \(\small{\text{EITHER }}\)\(\small{\text{DIE }}\)\(\small{\text{IS }}\normalsize2\)
    Answer

    We can understand the compound event \(\small{\text{EITHER }}\)\(\small{\text{DIE }}\)\(\small{\text{IS }}\normalsize2\) as \(\small{\text{FIRST }}\)\(\small{\text{DIE }}\)\(\small{\text{IS }}\normalsize2\)\(\normalsize{\text{ or }}\)\(\small{\text{SECOND }}\)\(\small{\text{DIE }}\)\(\small{\text{IS }}\normalsize2.\) \(\small{\text{FIRST }}\)\(\small{\text{DIE }}\)\(\small{\text{IS }}\normalsize2\) consists of the \(6\) outcomes of the second row, and \(\small{\text{SECOND }}\)\(\small{\text{DIE }}\)\(\small{\text{IS }}\normalsize2\) consists of the \(6\) outcomes of second column. Note that these compound events are not mutually exclusive because the outcome where both dice are \(2\) is in both compound events. If we count the outcomes between both compound events, we arrive at \(11\) outcomes in the compound event \(\small{\text{EITHER }}\)\(\small{\text{DIE }}\)\(\small{\text{IS }}\normalsize2.\) Thus \(P(\small{\text{EITHER DIE }}\)\(\small{\text{IS }}\normalsize2)\) \(=\frac{11}{36}.\)

    1. Event: \(\small{\text{SUM }}\)\(\small{\text{OF }}\)\(\small{\text{THE }}\)\(\small{\text{TWO }}\)\(\small{\text{VALUES }}\)\(\small{\text{IS }}\normalsize7\)\(\normalsize{\text{ and }}\)\(\small{\text{EITHER }}\)\(\small{\text{DIE }}\)\(\small{\text{IS }}\normalsize2\)
    Answer

    We need both \(\small{\text{SUM }}\)\(\small{\text{OF }}\)\(\small{\text{THE }}\)\(\small{\text{TWO }}\)\(\small{\text{VALUES }}\)\(\small{\text{IS }}\normalsize7\) and \(\small{\text{EITHER }}\)\(\small{\text{DIE }}\)\(\small{\text{IS }}\normalsize2\) to occur for our event to occur. We thus look for the overlap between the outcomes in each compound event. Only two of the outcomes from \(\small{\text{SUM }}\)\(\small{\text{OF }}\)\(\small{\text{THE }}\)\(\small{\text{TWO }}\)\(\small{\text{VALUES }}\)\(\small{\text{IS }}\normalsize7\) have a \(2\) in them. Thus there are only two outcomes in the compound event \(\small{\text{SUM }}\)\(\small{\text{OF }}\)\(\small{\text{THE }}\)\(\small{\text{TWO }}\)\(\small{\text{VALUES }}\)\(\small{\text{IS }}\normalsize7\)\(\normalsize{\text{ and }}\)\(\small{\text{EITHER }}\)\(\small{\text{DIE }}\)\(\small{\text{IS }}\normalsize2.\) Thus \(P(\small{\text{SUM }}\)\(\small{\text{OF }}\)\(\small{\text{THE }}\)\(\small{\text{TWO }}\)\(\small{\text{VALUES }}\)\(\small{\text{IS }}\normalsize7\)\(\normalsize{\text{ and }}\)\(\small{\text{EITHER }}\)\(\small{\text{DIE }}\)\(\small{\text{IS }}\normalsize2)\) \(=\frac{2}{36}\) \(=\frac{1}{18}.\)

    1. Event: \(\small{\text{SUM }}\)\(\small{\text{OF }}\)\(\small{\text{THE }}\)\(\small{\text{TWO }}\)\(\small{\text{VALUES }}\)\(\small{\text{IS }}\normalsize7|\small{\text{EITHER }}\)\(\small{\text{DIE }}\)\(\small{\text{IS }}\normalsize2\)
    Answer

    We first recall that \(|\) denotes "given." Thus our event of interest is \(\small{\text{SUM }}\)\(\small{\text{OF }}\)\(\small{\text{THE }}\)\(\small{\text{TWO }}\)\(\small{\text{VALUES }}\)\(\small{\text{IS }}\normalsize7\)\(\normalsize{\text{ given }}\)\(\small{\text{EITHER }}\)\(\small{\text{DIE }}\)\(\small{\text{IS }}\normalsize2.\) We know that there are only \(11\) outcomes in the event \(\small{\text{EITHER }}\)\(\small{\text{DIE }}\)\(\small{\text{IS }}\normalsize2\) and that only \(2\) of those outcomes (\(2\) and \(5,\) and \(5\) and \(2\)) add up to \(7.\) Thus \(P(\small{\text{SUM }}\)\(\small{\text{OF }}\)\(\small{\text{THE }}\)\(\small{\text{TWO }}\)\(\small{\text{VALUES }}\)\(\small{\text{IS }}\normalsize7|\small{\text{EITHER }}\)\(\small{\text{DIE }}\)\(\small{\text{IS }}\normalsize2)\) \(=\frac{2}{11}.\)

    1. Event: \(\small{\text{EITHER }}\)\(\small{\text{DIE }}\)\(\small{\text{IS }}\normalsize2|\small{\text{SUM }}\)\(\small{\text{OF }}\)\(\small{\text{THE }}\)\(\small{\text{TWO }}\)\(\small{\text{VALUES }}\)\(\small{\text{IS }}\normalsize7\)
    Answer

    Our event of interest is \(\small{\text{EITHER }}\)\(\small{\text{DIE }}\)\(\small{\text{IS }}\normalsize2\)\(\normalsize{\text{ given }}\)\(\small{\text{SUM }}\)\(\small{\text{OF }}\)\(\small{\text{THE }}\)\(\small{\text{TWO }}\)\(\small{\text{VALUES }}\)\(\small{\text{IS }}\normalsize7.\) From our previous exercise, we know that there are only \(6\) outcomes in the event \(\small{\text{SUM }}\)\(\small{\text{OF }}\)\(\small{\text{THE }}\)\(\small{\text{TWO }}\)\(\small{\text{VALUES }}\)\(\small{\text{IS }}\normalsize7\) and that only \(2\) of those outcomes, \(2\) and \(5,\) and \(5\) and \(2,\) include \(2.\) Thus \(P(\small{\text{EITHER }}\)\(\small{\text{DIE }}\)\(\small{\text{IS }}\normalsize2|\small{\text{SUM }}\)\(\small{\text{OF }}\)\(\small{\text{THE }}\)\(\small{\text{TWO }}\)\(\small{\text{VALUES }}\)\(\small{\text{IS }}\normalsize7)\) \(=\frac{2}{6}\) \(=\frac{1}{3}.\)

    Terminological Consideration: Simple Events

    Some statisticians and educators introduce the term simple event to help students better handle complex event descriptions. The general idea is that we can better understand or more easily compute probabilities when complex event descriptions are understood using combinations of other most basic events called simple events. The difficulty in such a presentation lies in the subjective and experiential aspects of understanding descriptions as basic and straightforward. To avoid the technical difficulty of a sufficient definition and application, we avoid the term throughout the book but, hopefully, still manage to instill the underlying concept.

    Compound Events and Counting

    Again, we build our intuition by counting when rolling a single fair die. When we were considering the compound event \(\small\text{EVEN}\)\(\normalsize\text{ or }\)\(\small\text{PERFECT }\)\(\small\text{SQUARE},\) computing the probability boiled down to two counting questions: how large is the sample space and how many outcomes comprise the compound event? The first counting question has an answer of \(6.\) Having already worked the problem, we know the answer to the second question is \(4,\) but how does this relate to the two separate events that form our compound event? In counting the outcomes in \(\small\text{EVEN},\) we arrive at \(3,\) and the number of outcomes in \(\small\text{PERFECT }\)\(\small\text{SQUARE}\) is \(2.\) It would appear that the number of outcomes in \(\small\text{EVEN}\)\(\normalsize\text{ or }\)\(\small\text{PERFECT }\)\(\small\text{SQUARE}\) is \(3+2\) \(=5.\) Our previous work shows that the answer is \(4.\) We must have counted some outcome(s) twice, which can happen whenever the events are not mutually exclusive. Recall that the outcome \(4\) is both even and a perfect square but should only be counted once. The outcomes that are counted twice are in both \(\small\text{EVEN}\) and \(\small\text{PERFECT }\)\(\small\text{SQUARE}.\) The total count is the number of outcomes in \(\small\text{EVEN}\) plus the number of outcomes in \(\small\text{PERFECT }\)\(\small\text{SQUARE}\) minus the number of outcomes in \(\small\text{EVEN}\)\(\normalsize\text{ and }\)\(\small\text{PERFECT }\)\(\small\text{SQUARE}\); namely, \(3+2-1\) \(=4.\)

    Formally, this is known as the Addition Rule for Counting. Given events \(A\) and \(B,\)\[\nonumber \text{# of outcomes in }(A \text{ or }B)=\text{# of outcomes in }A+\text{# of outcomes in }B-\text{# of outcomes in }(A \text{ and }B)\]

    Text Exercise \(\PageIndex{3}\)

    Explain how we used the Addition Rule for Counting at the beginning of this section when counting tiles and committees.

    Answer

    We were attempting to determine the many outcomes in a sample space. Each case can be identified as a compound event, and we joined these compound events using the word "or." We added each of the counts together to get the total sum. This looks similar to the addition rule, except we never had to subtract anything since the cases were mutually exclusive; no two cases shared an outcome. This would be like subtracting \(0\) outcomes. The addition rule was at play the whole time.

    Greater care must be taken when counting outcomes involving compound events formed using "and." We cannot mindlessly look to some formula that will always work; we must assess the situation and check that certain conditions are met. To develop our intuition regarding counting \(A\text{ and }B,\) we turn our attention to a more robust but familiar example, rolling two fair dice in sequence, and analyze: \(\small\text{EVEN }\)\(\small\text{FIRST}\)\(\normalsize{\text{ and }}\)\(\small\text{PERFECT }\)\(\small\text{SQUARE }\)\(\small\text{SECOND}.\)

    Context matters tremendously; read carefully and understand the current situation. We have dealt with the events \(\small\text{EVEN}\) and \(\small\text{PERFECT }\)\(\small\text{SQUARE}\) in the context of a roll of a single fair die. The sample space consists of \(36\) pairs of dice values; we are counting the number of outcomes with an even value for the first die and a perfect square for the second die. The multiplication rule worked well for determining the size of sample space because we could understand our outcomes as pairs of outcomes in sequence. Suppose we can understand \(\small\text{EVEN }\)\(\small\text{FIRST}\)\(\normalsize{\text{ and }}\)\(\small\text{PERFECT }\)\(\small\text{SQUARE }\)\(\small\text{SECOND}\) as two events in sequence, the same ideas apply. We apply the multiplication rule with the first activity, rolling the first die with an even face up \((3\) ways), and the second activity, rolling the second die with a perfect square face up \((2\) ways). We arrive at the conclusion there are \(3\cdot2\) \(=6\) outcomes in \(\small\text{EVEN }\)\(\small\text{FIRST}\)\(\normalsize{\text{ and }}\)\(\small\text{PERFECT }\)\(\small\text{SQUARE }\)\(\small\text{SECOND}\). For this example, we can easily construct the outcomes to confirm our count: \(2\) and \(1,\) \(4\) and \(1,\) \(6\) and \(1,\) \(2\) and \(4,\) \(4\) and \(4,\) and \(6\) and \(4.\)

    Text Exercise \(\PageIndex{4}\)

    Within the context of rolling two die in sequence, determine the number of outcomes in \(\small\text{ONE }\)\(\small\text{DIE }\)\(\small\text{IS }\)\(\small\text{EVEN }\)\(\small\text{WHILE }\)\(\small\text{THE }\)\(\small\text{OTHER }\)\(\small\text{IS }\)\(\small\text{A }\)\(\small\text{PERFECT }\)\(\small\text{SQUARE}.\)

    Answer

    To save space, let \(\small{\text{EVEN}}\)\(=E\) and \(\small\text{PERFECT }\)\(\small\text{SQUARE}\)\(=PS.\) We can understand the event as follows: \((E\small{\text{ FIRST}}\)\(\normalsize\text{ and }\)\(PS \small{\text{ SECOND}}\)\(\normalsize) \text{ or }\)\( (PS\small{\text{ FIRST}}\)\(\normalsize\text{ and }\)\(E \small{\text{ SECOND}}\normalsize)\). We can count the number of outcomes using both addition and multiplication rules. Applying the same logic as in the previous example and recognizing that \(4\) satisfies both events, yields:\[\text{# in }E\text{ and }PS\\=\text{# in } (E\small{\text{ FIRST }}\normalsize\text{ and }PS\small{\text{ SECOND }}\normalsize)+\text{# in } (PS\small{\text{ FIRST }}\normalsize\text{ and }E \small{\text{ SECOND }}\normalsize)-\text{# in }((E\small{\text{ FIRST }}\normalsize\text{ and }PS \small{\text{ SECOND }}\normalsize)\text{ and }(PS\small{\text{ FIRST }}\normalsize\text{ and }E \small{\text{ SECOND }}\normalsize))\\=3\cdot2+2\cdot3-1\\=6+6-1=11\nonumber\]

    Note that it might be tempting to describe \(\small\text{ONE }\)\(\small\text{DIE }\)\(\small\text{IS }\)\(\small\text{EVEN }\)\(\small\text{WHILE }\)\(\small\text{THE }\)\(\small\text{OTHER }\)\(\small\text{IS }\)\(\small\text{A }\)\(\small\text{PERFECT }\)\(\small\text{SQUARE}\) as the compound event \(\small{\text{EVEN}}\)\(\normalsize{\text{ and }}\)\(\small\text{PERFECT }\)\(\small\text{SQUARE}\). In the context of rolling two dice, we may interpret the event differently. For example, rolling a double \(4\) (satisfying both events), one die is even, and the other is a perfect square (one die satisfying one and the other die satisfying the other), or as long as both conditions are met between the two dice, the event occurs (a \(4\) with any other die value). Clarity in communication is key; put thought into the event description to protect it from ambiguity to the best of your ability.

    To conclude this section and formalize one last component of counting compound events, we consider a familiar context in probability: drawing cards from a standard deck of playing cards. We draw two cards in sequence from a single deck of standard playing cards without replacing the cards drawn and examine the compound event \(\small\text{SPADE }\)\(\small\text{FIRST}\)\(\normalsize{\text{ and }}\)\(\small\text{BLACK }\)\(\small\text{CARD }\)\(\small\text{SECOND}.\)

    Our counting procedure closely models the counting in the previous section. The phrasing of the compound event helps us readily understand our compound event as consisting of pairs of outcomes in sequence and uses the multiplication rule. There is, however, one stark contrast. In rolling two fair die and considering \(\small\text{EVEN }\)\(\small\text{FIRST}\)\(\normalsize{\text{ and }}\)\(\small\text{PERFECT }\)\(\small\text{SQUARE }\)\(\small\text{SECOND},\) the value of the first die did not affect the possible values of the second die. Whatever card we draw first cannot be drawn again in our current context. There is a dependency between the events. This does not hinder our ability to count using the multiplication rule; we have run into this idea before in Text Exercise \(3.2.2.\)b. There are \(13\) spades and \(26\) black cards in a standard deck of playing cards. There are \(13\) ways for \(\small\text{SPADE }\)\(\small\text{FIRST}\) to happen. Since we are counting the number of ways \(\small\text{SPADE }\)\(\small\text{FIRST}\)\(\normalsize{\text{ and }}\)\(\small\text{BLACK }\)\(\small\text{CARD }\)\(\small\text{SECOND}\) can happen, we count the number of ways our second card can be black given our first card was a spade. Since spades are black, only \(25\) black cards are left. We have the total number of outcomes \(13\cdot 25\) \(=325.\)

    We provide a Multiplication Rule for Counting Compound Events with "and." Given events \(A\) and \(B,\)\[\nonumber \text{# of outcomes in }A\text{ and }B= (\text{# outcomes in A})\cdot(\text{# outcomes in B|A})\]

    Text Exercise \(\PageIndex{5}\)

    Within the context of drawing two cards in sequence from a single deck of standard playing cards without replacing the cards drawn, determine the number of outcomes in the event \(\small\text{BLACK }\)\(\small\text{CARD }\)\(\small\text{FIRST}\)\(\normalsize{\text{ and }}\)\(\small\text{SPADE }\)\(\small\text{ SECOND}.\)

    Answer

    We are in a similar situation to the previous example; however, the order of the events has switched. We can easily understand the events as in sequence and apply the multiplication rule.\[\nonumber \text{# of outcomes in }\small{\text{BLACK CARD FIRST}}\normalsize{\text{ and }}\small{\text{SPADE SECOND}}\normalsize= (\text{# outcomes in }\small{\text{BLACK CARD FIRST}}\normalsize)\cdot(\text{# outcomes in }\small{\text{SPADE SECOND}}|\small{\text{BLACK CARD FIRST}}\normalsize)\]The count in the second term depends on whether or not a spade was drawn the first time. We, therefore, need to reformulate our approach. The event \(\small{\text{BLACK CARD}}\) consists of all the spades and clubs; so we can think of the event \(\small{\text{BLACK CARD}}\) as the compound event \(\small{\text{SPADE}}\) or \(\small{\text{CLUB}}\). Let us refer to these events as \(S\) and \(C,\) respectively. So we can understand our event as follows:\[\nonumber (\small{\text{S or C FIRST}}\normalsize{) \text{ and }}\small{\text{S SECOND}}\\(\small{\text{S FIRST}}\normalsize{\text{ and }}\small{\text{S SECOND}}\normalsize{\text{) or (}}\small{\text{C FIRST}}\normalsize{ \text{ and }}\small{\text{S SECOND}}\normalsize{)}\]We can thus apply both addition and multiplication rules to compute our total number of outcomes.\[\nonumber \text{# of outcomes in } \small{\text{S FIRST}}\normalsize{\text{ and }}\small{\text{S SECOND}}=13\cdot12=156 \\ \text{# of outcomes in }\small{\text{C FIRST}}\normalsize{ \text{ and }}\small{\text{S SECOND}}=13\cdot13=169\\ \text{# of outcomes in } (\small{\text{S FIRST}}\normalsize{\text{ and }}\small{\text{S SECOND}}\normalsize{\text{) and (}}\small{\text{C FIRST}}\normalsize{ \text{ and }}\small{\text{S SECOND}}\normalsize{)}=0\]Thus the total number of outcomes is \(156+169-0=\) \(325.\)

    Text Exercise \(\PageIndex{6}\)

    A family of \(5\) is attending a convention on family life. The theme of this year's convention is nature and quality time. The opening banquet will have \(4\) door prizes related to the current theme. The door prizes, in order, are a camper, a smokeless fire pit and patio furniture, a trampoline, and a set of bicycles. Any person in attendance can win at most one prize. The family of \(5\) recently invested in their backyard patio with new furniture and have a trampoline but are very interested in the other two prizes. If there will be \(400\) people in attendance, how many ways can the door prizes be awarded so that this family gets the first and the fourth prizes?

    Answer

    While winning quality prizes even if you do not need them can be exciting, the question excludes the case where the family wins all four prizes. The event of interest is \(\small\text{WINNING }\)\(\small\text{FIRST }\)\(\text{and }\)\(\small\text{LOSING }\)\(\small\text{SECOND }\)\(\text{and }\)\(\small\text{LOSING }\)\(\small\text{THIRD }\)\(\text{and }\)\(\small\text{WINNING }\)\(\small\text{FOURTH.}\) There are \(5\) ways of winning the first prize (one of the five family members must be chosen the winner), \(395\) ways of not winning the second prize given a successful win of the first prize, and \(394\) ways of not winning the third prize given the desired outcomes of the first and second prizes, and just \(4\) ways to win the last prize given the outcomes of the first three prizes. There are \(5\cdot395\cdot394\cdot4\) \(=3,112,600\) possibilities. This could happen in many ways, but what is the probability that it does happen? There are \(400\cdot399\cdot398\cdot397\) \(=25,217,757,600\) ways the prizes could be awarded. The probability of this becoming a reality is very small. \(\frac{3,112,600}{25,217,575,600}\) \(\approx0.01234\%.\) It would be highly unlikely for the family to win the first and fourth prizes.


    3.3: Counting and Compound Events is shared under a Public Domain license and was authored, remixed, and/or curated by The Math Department at Fort Hays State University.