# Question

Use induction to generalize Bonferroni’s inequality to n events. That is, show that

P(E1E2 . . .En) ≥ P(E1) + . . . + P(En) − (n − 1)

P(E1E2 . . .En) ≥ P(E1) + . . . + P(En) − (n − 1)

## Answer to relevant Questions

Consider Example 5o, which is concerned with the number of runs of wins obtained when n wins and m losses are randomly permuted. Now consider the total number of runs—that is, win runs plus loss runs—and show that Suppose that an ordinary deck of 52 cards (which contains 4 aces) is randomly divided into 4 hands of 13 cards each. We are interested in determining p, the probability that each hand has an ace. Let Ei be the event that the ...Fifty-two percent of the students at a certain college are females. Five percent of the students in this college are majoring in computer science. Two percent of the students are women majoring in computer science. If a ...There are 15 tennis balls in a box, of which 9 have not previously been used. Three of the balls are randomly chosen, played with, and then returned to the box. Later, another 3 balls are randomly chosen from the box. Find ...Consider a sample of size 3 drawn in the following manner: We start with an urn containing 5 white and 7 red balls. At each stage, a ball is drawn and its color is noted. The ball is then returned to the urn, along with an ...Post your question

0