Chapter 7: Problem 30
If 10 married couples are randomly seated at a round table, compute (a) the expected number and (b) the variance of the number of wives who are seated next to their husbands.
/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none}
Learning Materials
Features
Discover
Chapter 7: Problem 30
If 10 married couples are randomly seated at a round table, compute (a) the expected number and (b) the variance of the number of wives who are seated next to their husbands.
All the tools & learning materials you need for study success - in one app.
Get started for free
The number of accidents that a person has in a given year is a Poisson random variable with mean \(\lambda\). However, suppose that the value of \(\lambda\) changes from person to person, being equal to 2 for 60 percent of the population and 3 for the other 40 percent. If a person is chosen at random, what is the probability that he will have (a) 0 accidents and (b) exactly 3 accidents in a year? What is the conditional probability that he will have 3 accidents in a given year, given that he had no accidents the preceding year?
For Example 2 j show that the variance of the number of coupons needed to amass a full set is equal to $$ \sum_{i=1}^{N-1} \frac{i N}{(N-i)^{2}} $$ When \(N\) is large, this can be shown to be approximately equal (in the sense that their ratio approaches 1 as \(N \rightarrow \infty\) ) to \(N^{2}\left(\pi^{2} / 6\right)\).
Each of \(m+2\) players pays 1 unit to a kitty in order to play the following game. A fair coin is to be flipped successively \(n\) times, where \(n\) is an odd number, and the successive outcomes noted. Each player writes down, before the flips, a prediction of the outcomes. For instance, if \(n=3\), then a player might write down \((H, H, T)\), which means that he or she predicts that the first flip will land heads, the second heads, and the third tails. After the coins are flipped, the players count their total number of correct predictions. Thus, if the actual outcomes are all heads, then the player who wrote \((H, H, T)\) would have 2 correct predictions. The total kitty of \(m+2\) is then evenly - split up among those players having the largest number of correct predictions. Since each of the coin flips is equally likely to land on either heads or tails, \(m\) of the players have decided to make their predictions in a totally random fashion. Specifically, they will each flip one of their own fair coins \(n\) times and then use the result as their prediction. However, the final 2 of the players have formed a syndicate and will use the following strategy. One of them will make predictions in the same random fashion as the other \(m\).
Let \(A_{1}, A_{2}, \ldots, A_{n}\) be events, and let \(N\) denote the number of them that occur. Also, let \(I=1\) if all of these events occur, and let it be 0 otherwise. Prove Bonferroni's inequality, namely that $$ P\left(A_{1} \cdots A_{n}\right) \geq \sum_{i=1}^{n} P\left(A_{i}\right)-(n-1) $$ HINT: Argue first that \(N \leq n-1+I\).
For a standard normal random variable \(Z\), let \(\mu_{n}=E\left[Z^{\prime \prime}\right]\). Show that $$ \mu_{n}= \begin{cases}0 & \text { when } n \text { is odd } \\ \frac{(2 j) !}{2 j} j & \text { when } n=2 j\end{cases} $$ HINT: Start by expanding the moment generating function of \(Z\) into a Taylor series about 0 to obtain $$ \begin{aligned} E\left[e^{t Z}\right] &=e^{t^{2} / 2} \\ &=\sum_{j=0}^{\infty} \frac{\left(t^{2} / 2\right)^{j}}{j !} \end{aligned} $$
What do you think about this solution?
We value your feedback to improve our textbook solutions.