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

Question:Suppose that at least one of the events\({E_j},j = 1,2, \ldots ,m\), is guaranteed to occur and no more than two can occur. Show that if\(p\left( {{E_j}} \right) = q\)for\(j = 1,2, \ldots ,m\)and\(p\left( {{E_j} \cap {E_k}} \right) = r\)for\(1 \le j < k \le m\), then\(q \ge 1/m\)and\(r \le 2/m\).

Short Answer

Expert verified

Answer

Let\(X = \sum\limits_{j = 1}^m {{X_j}} \)be a random variable where\(X\_\left\{ j \right\} = 1,\)if\({E_j}\)occurs and 0 otherwise\(\forall j = 1,2, \ldots ,m.\) Obviously\(E\left( {{X_j}} \right) = P\left( {{E_j}} \right) = q\forall j\). Thus

\(E(X) = \sum\limits_{j = 1}^m E \left( {{X_j}} \right) = qm\).

Step by step solution

01

Formula for sum of Probabilities 

The probability of the event\(E\)is the sum of the probabilities of the outcomes in\(E\). That is,\(p(E) = \sum\limits_{s \in E} p (s).\)

(Note that when \(E\) is an infinite set, \(\sum\limits_{s \in E} p (s)\) is a convergent infinite series.)

02

Use Probability sum

Let\(X = \sum\limits_{j = 1}^m {{X_j}} \)be a random variable where\({X_j} = 1\), if\({E_j}\)occurs and\(0\)otherwise\(\forall j = 1,2, \ldots ,m\). Obviously\(E\left( {{X_j}} \right) = P\left( {{E_j}} \right) = q\forall j\).Thus

\(E(X) = \sum\limits_{j = 1}^m E \left( {{X_j}} \right) = qm\)

Since one of the events\({E_j}\) is certain to occur, so\(E(X) \ge 1 \Rightarrow q \ge \frac{1}{m}.\)

Again we observe that as one of the events is certain to occur and no more than two can occur so

\(P\left( {\bigcup\limits_{i = 1}^m {{E_j}} } \right) = \sum\limits_{i = 1}^m P \left( {{E_j}} \right) - \sum\limits_{i < j} P \left( {{E_i} \cap {E_j}} \right) = q \cdot m - \left( {\begin{aligned}{*{20}{c}}m\\2\end{aligned}} \right) \cdot r = 1\)

It follows using\(q \le 1\) that \(r = \frac{{gm - 1}}{{\left( {\begin{aligned}{*{20}{c}}m\\2\end{aligned}} \right)}} = \frac{2}{m} \cdot \frac{{gm - 1}}{{m - 1}} \le \frac{2}{m}.\)

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

Question: Suppose that \(E, {F_1},{F_2}\,and {F_3}\)are events from a sample space S and that \({F_1},{F_2}\,and {F_3}\) are pair wise disjoint and their union is S. Find \(p\left( {\frac{{{F_1}}}{E}} \right)\)if \(p\left( {\frac{E}{{{F_1}}}} \right) = \frac{1}{8},p\left( {\frac{E}{{{F_2}}}} \right) = \frac{1}{4},p\left( {\frac{E}{{{F_3}}}} \right) = \frac{1}{6},p\left( {{F_1}} \right) = \frac{1}{4},p\left( {{F_2}} \right) = \frac{1}{4}\) and \(p\left( {{F_3}} \right) = \frac{1}{2}\)

Question: In this exercise we will use Bayes' theorem to solve the Monty Hall puzzle (Example 10 in Section 7.1). Recall that in this puzzle you are asked to select one of three doors to open. There is a large prize behind one of the three doors and the other two doors are losers. After you select a door, Monty Hall opens one of the two doors you did not select that he knows is a losing door, selecting at random if both are losing doors. Monty asks you whether you would like to switch doors. Suppose that the three doors in the puzzle are labeled 1, 2, and 3. Let W be the random variable whose value is the number of the winning door: assume that \(p\left( {W = k} \right) = \frac{1}{3}\) for k=1,2,3. Let M denote the random variable whose value is the number of the door that Monty opens. Suppose you choose door i

a) What is the probability that you will win the prize if the game ends without Monty asking you whether you want to change doors?

b) Find \(p\left( {M = j\left| {W = k} \right.} \right)\) for j=1,2,3 and k= 1.2.3

e) Use Bayes' theorem to find \(p\left( {M = j\left| {M = k} \right.} \right)\) where i and j and are distinct values d) Explain why the answer to part (c) tells you whether you should change doors when Monty gives you the chance to do so,

Question: What is the probability that a five-card hand contains two pairs (that is, two of each of two different kinds and a fifth card of a third kind)?

Question: What is the expected number of heads that come up when

a fair coin is flipped 10 times?

Question: Use pseudocode to write out the probabilistic primality test described in Example 16.

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