Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

To Determine a formula for the probability of \({E_1} \cup {E_2} \cup {E_3}\).

Short Answer

Expert verified

The probability formula \(p\left( {{E_1} \cup {E_2} \cup {E_3}} \right) = \sum\limits_{i = 1}^3 p \left( {{E_i}} \right) - \sum\limits_{1 \le i < j \le 3} p \left( {{E_i} \cap {E_j}} \right) + p\left( {{E_1} \cap {E_2} \cap {E_3}} \right)\)

Step by step solution

01

 Given

The condition of probability \({E_1} \cup {E_2} \cup {E_3}\).

02

The Concept of Principle of inclusion-exclusion

Principle of inclusion-exclusion:

\(\left| {{A_1} \cup {A_2} \cup \ldots \cup {A_n}} \right| = \sum\limits_{1 \le i \le n} {\left| {{A_i}} \right|} - \sum\limits_{1 \le i < j \le n} {\left| {{A_i} \cap {A_j}} \right|} + \sum\limits_{1 \le i < j < k \le n} {\left| {{A_i} \cap {A_j} \cap {A_k}} \right|} \quad - \ldots . + \left| {{A_1} \cap {A_2} \cap \ldots . \cap {A_n}} \right|\)

03

Determine the probability Formula

Principle of inclusion-exclusion:

\(\left| {{A_1} \cup {A_2} \cup \ldots \cup {A_n}} \right| = \sum\limits_{1 \le i \le n} {\left| {{A_i}} \right|} - \sum\limits_{1 \le i < j \le n} {\left| {{A_i} \cap {A_j}} \right|} + \sum\limits_{1 \le i < j < k \le n} {\left| {{A_i} \cap {A_j} \cap {A_k}} \right|} \quad - \ldots . + \left| {{A_1} \cap {A_2} \cap \ldots . \cap {A_n}} \right|\)

The probability of any event \(E \subseteq S\) is \(p\left( {{E_i}} \right) = \frac{{|E|}}{{|S|}}\).

Thus, using the inclusion-exclusion principle:

\(\begin{aligned}{c}p\left( {{E_1} \cup {E_2} \cup {E_3}} \right) &= \frac{{\left| {{E_1} \cup {E_2} \cup {E_3}} \right|}}{{|S|}}\\ &= \frac{{\left| {{E_1}} \right| + \left| {{E_2}} \right| + \left| {{E_3}} \right| - \left| {{E_1} \cap {E_2}} \right| - \left| {{E_1} \cap {E_3}} \right| - \left| {{E_2} \cap {E_3}} \right| + \left| {{E_1} \cap {E_2} \cap {E_3}} \right|}}{{|S|}}\\p\left( {{E_1} \cup {E_2} \cup {E_3}} \right) &= \sum\limits_{i = 1}^3 p \left( {{E_i}} \right) - \sum\limits_{1 \le i < j \le 3} p \left( {{E_i} \cap {E_j}} \right) + p\left( {{E_1} \cap {E_2} \cap {E_3}} \right)\end{aligned}\)

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

47. A new employee at an exciting new software company starts with a salary of550,000and is promised that at the end of each year her salary will be double her salary of the previous year, with an extra increment of$ 10,000 for each year she has been with the company.

a) Construct a recurrence relation for her salary for hern th year of employment.

b) Solve this recurrence relation to find her salary for hern th year of employment.

Some linear recurrence relations that do not have constant coefficients can be systematically solved. This is the case for recurrence relations of the form \(f(n){a_n} = g(n){a_{n - 1}} + h(n)\)Exercises 48-50 illustrate this.

Use Exercise 31 to show that if a<bd, thenf(n)isO(nd).

Suppose that the votes of npeople for different candidates (where there can be more than two candidates) for a particular office are the elements of a sequence. A person wins the election if this person receives a majority of the votes.

a) Devise a divide-and-conquer algorithm that determines whether a candidate received a majority and, if so, determine who this candidate is. [Hint: Assume that nis even and split the sequence of votes into two sequences, each with n/2elements. Note that a candidate could not have received a majority of votes without receiving a majority of votes in at least one of the two halves.]

b) Use the master theorem to give a big-Oestimate for the number of comparisons needed by the algorithm you devised in part (a).

Suppose that c1,c2,โ€ฆ,cpis a longest common subsequence of the sequences a1,a2,โ€ฆ,amandb1,b2,โ€ฆ,bn.
a) Show that if am=bn, then cp=am=bnand c1,c2,โ€ฆ,cp-1is a longest common subsequence of a1,a2,โ€ฆ,am-1and b1,b2,โ€ฆ,bn-1 when p>1.
b) Suppose that amโ‰ bn. Show that if cpโ‰ am, then c1,c2,โ€ฆ,cpis a longest common subsequence of a1,a2,โ€ฆ,am-1and b1,b2,โ€ฆ,bnand also show that if cpโ‰ bn, then c1,c2,โ€ฆ,cpis a longest common subsequence of a1,a2,โ€ฆ,amandb1,b2,โ€ฆ,bn-1

How many comparisons are needed for a binary search in a set of 64 elements?

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free