Skip to main content
Mathematics LibreTexts

5.2.1: The Addition Rule for Probability

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

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

    \( \newcommand{\dsum}{\displaystyle\sum\limits} \)

    \( \newcommand{\dint}{\displaystyle\int\limits} \)

    \( \newcommand{\dlim}{\displaystyle\lim\limits} \)

    \( \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{\longvect}{\overrightarrow}\)

    \( \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}\)
    A group of students is standing in a line holding plates of food.
    Figure \(\PageIndex{1}\): Students can be sorted using a variety of possible categories like class year, major, whether they are a varsity athlete, and so forth. (credit: “Multicultural Mashup Melds Languages, Cultures at COD 36” by COD Newsroom/Flickr, CC BY 2.0)
    Learning Objectives
    1. Identify mutually exclusive events.
    2. Apply the Addition Rule to compute probability.
    3. Use the Inclusion/Exclusion Principle to compute probability.

    Up to this point, we have looked at the probabilities of simple events. Simple events are those with a single, simple characterization. Sometimes, though, we want to investigate more complicated situations. For example, if we are choosing a college student at random, we might want to find the probability that the chosen student is a varsity athlete or in a Greek organization. This is a compound event: there are two possible criteria that might be met. We might instead try to identify the probability that the chosen student is both a varsity athlete and in a Greek organization. In this section and the next, we’ll cover probabilities of two types of compound events: those build using “or” and those built using “and.” We’ll deal with the former first.

    Mutual Exclusivity

    Before we get to the key techniques of this section, we must first introduce some new terminology. Let’s say you’re drawing a card from a standard deck. We’ll consider 3 events: HH is the event “the card is a ,” TT is the event “the card is a 10,” and SS is the event “the card is a .” If the card drawn is JJ, then HH and TT didn’t occur, but SS did. If the card drawn is instead 1010, then HH didn’t occur, but both TT and SS did.

    We can see from these examples that, if we are interested in several possible events, more than one of them can occur simultaneously (both TT and SS, for example). But, if you think about all the possible outcomes, you can see that HH and SS can never occur simultaneously; there are no cards in the deck that are both and . Pairs of events that cannot both occur simultaneously are called mutually exclusive. Let’s go through an example to help us better understand this concept.

    Example \(\PageIndex{1}\): Identifying Mutually Exclusive Events

    Decide whether the following events are mutually exclusive. If they are not mutually exclusive, identify an outcome that would result in both events occurring.

    1. You are about to roll a standard 6-sided die. EE is the event “the die shows an even number” and FF is the event “the die shows an odd number.”
    2. You are about to roll a standard 6-sided die. EE is the event “the die shows an even number” and SS is the event “the die shows a number less than 4.”
    3. You are about to flip a coin 4 times. JJ is the event “at least 2 heads are flipped” and KK is the event “fewer than 3 tails are flipped.”
    Answer
    1. Let’s look at the outcomes for each event: E={2,4,6}E={2,4,6} and F={1,3,5}F={1,3,5}. There are no outcomes in common, so EE and FF are mutually exclusive.
    2. Again, consider the outcomes in each event: E={2,4,6}E={2,4,6} and S={1,2,3}S={1,2,3}. Since the outcome 2 belongs to both events, these are not mutually exclusive.
    3. Suppose the results of the 4 flips are HTTH. Then at least 2 heads are flipped, and fewer than 3 tails are flipped. That means that both JJ and KK occurred, and so these events are not mutually exclusive.
    Your Turn \(\PageIndex{1}\)

    Suppose you’re about to draw one card from a deck containing only these 10 cards: \({\text{A}}♡\), \({\text{A}}♠\), \({\text{A}}♣\), \({\text{A}}\diamondsuit\), \({\text{K}}♠\), \({\text{K}}♣\), \({\text{Q}}♡\), \({\text{Q}}♠\), \({\text{J}}♡\), \({\text{J}}♠\). Decide whether these events are mutually exclusive:

    \(E\) is the event “the card is an ace” and \(F\) is the event “the card is a king.”

    \(R\) is the event “the card is a \(♡\) ” and \(E\) is the event “the card is an ace.”

    \(R\) is the event “the card is a \(♡\) ” and \(F\) is the event “the card is a king.”

    The Addition Rule for Mutually Exclusive Events

    If two events are mutually exclusive, then we can use addition to find the probability that one or the other event occurs.

    FORMULA

    If EE and FF are mutually exclusive events, then

    \(P(E\) or \(F)=P(E)+P(F)\)

    Why does this formula work? Let’s consider a basic example. Suppose we’re about to draw a Scrabble tile from a bag containing A, A, B, E, E, E, R, S, S, U. What is the probability of drawing an E or an S? Since 3 of the tiles are marked with E and 2 are marked with S, there are 5 tiles that satisfy the criteria. There are ten tiles in the bag, so the probability is 510=12510=12. Notice that the probability of drawing an E is 310310 and the probability of drawing an S is 210210; adding those together, we get 310+210=510310+210=510. Look at the numerators in the fractions involved in the sum: the 3 represents the number of E tiles and the 2 is the number of S tiles. This is why the Addition Rule works: The total number of outcomes in one event or the other is the sum of the numbers of outcomes in each of the individual events.

    Example \(\PageIndex{2}\): Using the Addition Rule

    For each of the given pairs of events, decide if the Addition Rule applies. If it does, use the Addition Rule to find the probability that one or the other occurs.

    1. You are rolling a standard 6-sided die. Event AA is “roll an even number” and event BB is “roll a 3.”
    2. You are drawing a card at random from a standard 52-card deck. Event RR is “draw a ” and event SS is “draw a king.”
    3. You are rolling a pair of standard 6-sided dice. Example 7.18 might help.

      A table with 6 rows and 6 columns. The columns represent the first die and are titled, 1, 2, 3, 4, 5, and 6. The rows represent the second die and are titled, 1, 2, 3, 4, 5, and 6. The data is as follows: Row 1: 2, 3, 4, 5, 6, 7. Row 2: 3, 4, 5, 6, 7, 8. Row 3: 4, 5, 6, 7, 8, 9. Row 4: 5, 6, 7, 8, 9, 10. Row 5: 6, 7, 8, 9, 10, 11. Row 6: 7, 8, 9, 10, 11, 12.

      Figure \(\PageIndex{2}\)
    Answer
    1. Since 3 is not an even number, these events are mutually exclusive. So, we can use the Addition Rule: since P(A)=36P(A)=36 and P(B)=16P(B)=16, we get P(AorB)=36+16=23P(AorB)=36+16=23.
    2. If the card drawn is KK, then both RR and SS occur. So, they aren’t mutually exclusive, and the Addition Rule doesn’t apply.
    3. Since 10 is not odd, these events are mutually exclusive. Since P(E)=1836P(E)=1836 and P(F)=336P(F)=336, the Addition Rule gives us P(EorF)=1836+336=712P(EorF)=1836+336=712.
    Your Turn \(\PageIndex{2\)

    Suppose you’re about to draw one card from a deck containing only these 10 cards:
    \({\text{A}}♡\), \({\text{A}}♠\), \({\text{A}}♣\), \({\text{AA}}\diamondsuit\), \({\text{K}}♠\), \({\text{K}}♣\), \({\text{Q}}♡\), \({\text{Q}}♠\), \({\text{J}}♡\), \({\text{J}}♠\). If appropriate, use the Addition Rule to find the probability that one or the other of these events occurs:

    \(E\) is the event “the card is an ace” and \(F\) is the event “the card is a king.”

    \(R\) is the event “the card is a \(♡\) ” and \(E\) is the event “the card is an ace.”

    \(R\) is the event “the card is a \(♡\) ” and \(F\) is the event “the card is a king.”

    Finding Probabilities When Events Aren’t Mutually Exclusive

    Let’s return to the example we used to explore the Addition Rule: We’re about to draw a Scrabble tile from a bag containing A, A, B, E, E, E, R, S, S, U. Consider these events: JJ is “draw a vowel” and KK is “draw a letter that comes after L in the alphabet.” Since there are 6 vowels, P(J)=610P(J)=610. There are 4 tiles with letters that come after L alphabetically, so P(K)=410P(K)=410. What is P(JorK)P(JorK)? If we blindly apply the Addition Rule, we get 610+410=1610+410=1, which would mean that the compound event JJ or KK is certain. However, it’s possible to draw a B, in which case neither JJ nor KK happens. Where’s the error?

    The events are not mutually exclusive: the outcome U belongs to both events, and so the Addition Rule doesn’t apply. However, there’s a way to extend the Addition Rule to allow us to find this probability anyway; it’s called the Inclusion/Exclusion Principle. In this example, if we just add the two probabilities together, the outcome U is included in the sum twice: It’s one of the 6 outcomes represented in the numerator of 610610, and it’s one of the 4 outcomes represented in the numerator of 410410. So, that particular outcome has been “double counted.” Since it has been included twice, we can get a true accounting by excluding it once: 610+410110=910610+410110=910. We can generalize this idea to a formula that we can apply to find the probability of any compound event built using “or.”

    FORMULA

    Inclusion/Exclusion Principle: If EE and FF are events that contain outcomes of a single experiment, then

    \[P(E \text { or } F)=P(E)+P(F)-P(E \text { and } F) \nonumber \]

    .

    It’s worth noting that this formula is truly an extension of the Addition Rule. Remember that the Addition Rule requires that the events EE and FF are mutually exclusive. In that case, the compound event (EandF)(EandF) is impossible, and so P(EandF)=0P(EandF)=0. So, in cases where the events in question are mutually exclusive, the Inclusion/Exclusion Principle reduces to the Addition Rule.

    Example 7.\(\PageIndex{3}\): Using the Inclusion/Exclusion Principle

    Suppose we have events EE, FF, and GG, associated with these probabilities:

    \[\begin{aligned}
    P(E) & =0.45 \\
    P(F) & =0.6 \\
    P(G) & =0.55 \\
    P(E \text { and } F) & =0.2 \\
    P(E \text { and } G) & =0.2 \\
    P(F \text { and } G) & =0.25
    \end{aligned} \nonumber \]

    Compute the following:
    1. \(P(E\) or \(F)\)
    2. \(P(E\) or \(G)\)
    3. \(P(F\) or \(G)\)

    Answer
    1. Using the Inclusion/Exclusion Principle, we get: P(EorF)=P(E)+P(F)P(EandF)=0.45+0.60.2=0.85. P(EorF)=P(E)+P(F)P(EandF)=0.45+0.60.2=0.85.
    2. Again, we’ll apply the Inclusion/Exclusion Principle:

      P(EorG)=P(E)+P(G)P(EandG) =0.45+0.550.2 =0.8. P(EorG)=P(E)+P(G)P(EandG) =0.45+0.550.2 =0.8.

    3. Applying the Inclusion/Exclusion Principle one more time:

      P(ForG)=P(F)+P(G)P(FandG)=0.6+0.550.25=0.9. P(ForG)=P(F)+P(G)P(FandG)=0.6+0.550.25=0.9.

    Your Turn \(\PageIndex{3}\)

    You are about to roll a special 6-sided die that has both a colored letter and a colored number on each face. The faces are labeled with: a red 1 and a blue A, a red 1 and a green A, an orange 1 and a green B, an orange 2 and a red C, a purple 3 and a brown D, an orange 4 and a blue E. Find the probabilities of these events:

    The number is orange or even.

    The letter is green or an A.

    The number is even or the letter is green.

    Check Your Understanding

    You are about to draw a card at random from a deck containing only these 10 cards: \({\text{A}} ♡\), \({\text{A}} ♠\), \({\text{A}} ♣\), \({\text{A}}\diamondsuit\), \({\text{K}}♠\), \({\text{K}}♣\), \({\text{Q}}♡\), \({\text{Q}}♠\), \({\text{J}}♡\), \({\text{J}}♠\). Compute the following probabilities:

    1. You draw an ace or a king.
    2. You draw a \(♠\) or a \(♣\).
    3. You draw an ace or a \(♡\).
    4. You draw a jack or a \(♡\).
    5. You draw a jack or a \(♣\).
    6. You draw a king or a \(\diamondsuit\).

    This page titled 5.2.1: The Addition Rule for Probability is shared under a CC BY 4.0 license and was authored, remixed, and/or curated by OpenStax via source content that was edited to the style and standards of the LibreTexts platform.