# Question: An urn contains a white and b black balls After

An urn contains a white and b black balls. After a ball is drawn, it is returned to the urn if it is white; but if it is black, it is replaced by a white ball from another urn. Let Mn denote the expected number of white balls in the urn after the foregoing operation has been repeated n times.

(a) Derive the recursive equation

Mn+1 = (1 – 1/a + b) Mn + 1

(b) Use part (a) to prove that

Mn = a + b – b (1 – 1/a + b)n

(c) What is the probability that the (n + 1)st ball drawn is white?

(a) Derive the recursive equation

Mn+1 = (1 – 1/a + b) Mn + 1

(b) Use part (a) to prove that

Mn = a + b – b (1 – 1/a + b)n

(c) What is the probability that the (n + 1)st ball drawn is white?

**View Solution:**## Answer to relevant Questions

Let X be a random variable having finite expectation μ and variance σ2, and let g(∙) be a twice differentiable function. Show that Expand g(∙) in a Taylor series about μ. Use the first three terms and ignore the ...We have 100 components that we will put in use in a sequential fashion. That is, component 1 is initially put in use, and upon failure, it is replaced by component 2, which is itself replaced upon failure by component 3, and ...Let X be a Poisson random variable with mean 20. (a) Use the Markov inequality to obtain an upper bound on p = P{X ≥ 26} (b) Use the one-sided Chebyshev inequality to obtain an upper bound on p. (c) Approximate p by making ...If X is a Poisson random variable with mean λ, show that for i < λ, P{X ≤ i} ≤ e−λ(eλ)i / ii In Example 2c we simulated the absolute value of a unit normal by using the rejection procedure on exponential random variables with rate 1. This raises the question of whether we could obtain a more efficient algorithm by ...Post your question