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

Independent trials, each resulting in success with probability \(p\), are performed. (a) Find the expected number of trials needed for there to have been both at least \(n\) successes or at least \(m\) failures. Hint: Is it useful to know the result of the first \(n+m\) trials? (b) Find the expected number of trials needed for there to have been either at least \(n\) successes or at least \(m\) failures. Hint: Make use of the result from part (a).

Short Answer

Expert verified
The expected number of trials needed to achieve either at least \(n\) successes or at least \(m\) failures is given by: \[E(k) = \sum_{k=0}^\infty k \sum_{i=0}^{n-1} \sum_{j=0}^{m-1}\binom{k}{i}\binom{k}{j}p^{i+j}(1-p)^{2k-i-j} \] To find the expected number of trials, plug in the specific values for \(p\), \(n\), and \(m\).

Step by step solution

01

Find the Probability

We want to find the probability \(\displaystyle P( X\geq n\ \text{or}\ Y\geq m)\), where \(\displaystyle X\) represents the number of successes and \(\displaystyle Y\) represents the number of failures. Define \(\displaystyle A\) as the event that there are at least \(\displaystyle n\) successes in a fixed number of trials, and \(\displaystyle B\) as the event that there are at least \(\displaystyle m\) failures in the same number of trials. Using complementary probabilities, we can write the desired probability as: \(\displaystyle P( A\ \text{or}\ B)=1-P( A^{C} \ \text{and}\ B^{C})\) where \(\displaystyle A^{C}\) denotes the complementary event of \(\displaystyle A\) (not \(\displaystyle A\) happening) and similarly for \(\displaystyle B^{C}\). Since the trials are independent, we have: \(\displaystyle P( A^{C} \ \text{and}\ B^{C})= P( A^{C})P( B^{C})\) The problem ultimately asks us to compute the expected number of trials needed for either \(\displaystyle A\) or \(\displaystyle B\) to happen.
02

Calculate the Expected Number of Trials

The expected value can be computed as the sum of probabilities for reality. Let \(\displaystyle k\) be the number of trials; then the expected number of trials can be calculated as: \[E(k) = \sum_{k=0}^{\infty} k \cdot P_k(A \ \text{or} \ B) \] Substituting the complementary probability, \[E(k) = \sum_{k=0}^\infty k[P(A^{C} \ \text{and} \ B^{C})_k] \] Since the trials are independent, we can write \[ P(A^C) = \left( 1-\sum_{i=0}^{n-1} \binom{k}{i} p^i(1-p)^{k-i} \right) \] and \[ P(B^C) = \left( 1-\sum_{i=0}^{m-1} \binom{k}{i} p^{k-i}(1-p)^{i} \right) \] Substituting back, we get \[E(k) =\sum_{k=0}^\infty k \left [ \left( 1-\sum_{i=0}^{n-1} \binom{k}{i} p^i(1-p)^{k-i} \right)\left( 1-\sum_{i=0}^{m-1} \binom{k}{i} p^{k-i}(1-p)^{i} \right) \right ] \] Now, it's easier to manage tabs:
03

Simplify the expression

Using linearity of expectation, we have : \[E(k) = \sum_{k=0}^\infty k \sum_{i=0}^{n-1} \sum_{j=0}^{m-1}\binom{k}{i}\binom{k}{j}p^{i+j}(1-p)^{2k-i-j} \] The expression inside the summation represents the probability of obtaining exactly \(\displaystyle i\) successes and \(\displaystyle j\) failures. This is the expected number of trials needed to achieve either at least \(\displaystyle n\) successes or at least \(\displaystyle m\) failures. To calculate the value, plug in the specific values for \(\displaystyle p\), \(\displaystyle n\), and \(\displaystyle 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

Consider a large population of families, and suppose that the number of children in the different families are independent Poisson random variables with mean \(\lambda\). Show that the number of siblings of a randomly chosen child is also Poisson distributed with mean \(\lambda\).

\(A, B\), and \(C\) are evenly matched tennis players. Initially \(A\) and \(B\) play a set, and the winner then plays \(C\). This continues, with the winner always playing the waiting player, until one of the players has won two sets in a row. That player is then declared the overall winner. Find the probability that \(A\) is the overall winner.

Let \(N\) be a hypergeometric random variable having the distribution of the number of white balls in a random sample of size \(r\) from a set of \(w\) white and \(b\) blue balls. That is, $$ P\\{N=n\\}=\frac{\left(\begin{array}{c} w \\ n \end{array}\right)\left(\begin{array}{c} b \\ r-n \end{array}\right)}{\left(\begin{array}{c} w+b \\ r \end{array}\right)} $$ where we use the convention that \(\left(\begin{array}{c}m \\\ j\end{array}\right)=0\) if either \(j<0\) or \(j>m\). Now, consider a compound random variable \(S_{N}=\sum_{i=1}^{N} X_{i}\), where the \(X_{i}\) are positive integer valued random variables with \(\alpha_{j}=P\left\\{X_{i}=j\right\\}\) (a) With \(M\) as defined as in Section \(3.7\), find the distribution of \(M-1\). (b) Suppressing its dependence on \(b\), let \(P_{w, r}(k)=P\left\\{S_{N}=k\right\\}\), and derive a recursion equation for \(P_{w, r}(k)\). (c) Use the recursion of (b) to find \(P_{w, r}(2)\).

A coin having probability \(p\) of coming up heads is continually flipped. Let \(P_{j}(n)\) denote the probability that a run of \(j\) successive heads occurs within the first \(n\) flips. (a) Argue that $$ P_{j}(n)=P_{j}(n-1)+p^{j}(1-p)\left[1-P_{j}(n-j-1)\right] $$ (b) By conditioning on the first non-head to appear, derive another equation relating \(P_{j}(n)\) to the quantities \(P_{j}(n-k), k=1, \ldots, j\)

Find the expected number of flips of a coin, which comes up heads with probability \(p\), that are necessary to obtain the pattern \(h, t, h, h, t, h, t, h\).

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