Chapter 7: Q.26 (page 361)
Prove that.
Short Answer
We prove that,
Chapter 7: Q.26 (page 361)
Prove that.
We prove that,
All the tools & learning materials you need for study success - in one app.
Get started for freeA prisoner is trapped in a cell containingdoors. The first door leads to a tunnel that returns him to his cell after days’ travel. The second leads to a tunnel that returns him to his cell after days’ travel. The third door leads to freedom after day of travel. If it is assumed that the prisoner will always select doors and with respective probabilities and ., what is the expected number of days until the prisoner reaches freedom?
The joint density of and is given by ,, Compute .
A bottle initially contains m large pills and n small pills. Each day, a patient randomly chooses one of the pills. If a small pill is chosen, then that pill is eaten. If a large pill is chosen, then the pill is broken in two; one part is returned to the bottle (and is now considered a small pill) and the other part is then eaten.
(a) Let X denote the number of small pills in the bottle after the last large pill has been chosen and its smaller half returned. Find E[X].
Hint: Define n + m indicator variables, one for each of the small pills initially present and one for each of the small pills created when a large one is split in two. Now use the argument of Example m.
(b) Let Y denote the day on which the last large pills chosen. Find E[Y].
Hint: What is the relationship between X and Y?
Prove Proposition when
and have a joint probability mass function;
and have a joint probability density function and
for all .
How many times would you expect to roll a fair die before all sides appeared at least once?
What do you think about this solution?
We value your feedback to improve our textbook solutions.