Chapter 3: Problem 14
Let \(X\) be uniform over \((0,1)\). Find \(E\left[X \mid X<\frac{1}{2}\right]\).
/*! 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 3: Problem 14
Let \(X\) be uniform over \((0,1)\). Find \(E\left[X \mid X<\frac{1}{2}\right]\).
All the tools & learning materials you need for study success - in one app.
Get started for free
Suppose there are \(n\) types of coupons, and that the type of each new coupon obtained is independent of past selections and is equally likely to be any of the \(n\) types. Suppose one continues collecting until a complete set of at least one of each type is obtained. (a) Find the probability that there is exactly one type \(i\) coupon in the final collection. Hint: Condition on \(T\), the number of types that are collected before the first type \(i\) appears. (b) Find the expected number of types that appear exactly once in the final collection.
In the match problem, say that \((i, j), i
Suppose \(p(x, y, z)\), the joint probability mass function of the random variables \(X, Y\), and \(Z\), is given by $$ \begin{array}{ll} p(1,1,1)=\frac{1}{8}, & p(2,1,1)=\frac{1}{4}, \\ p(1,1,2)=\frac{1}{8}, & p(2,1,2)=\frac{3}{16}, \\ p(1,2,1)=\frac{1}{16}, & p(2,2,1)=0, \\ p(1,2,2)=0, & p(2,2,2)=\frac{1}{4} \end{array} $$ What is \(E[X \mid Y=2] ?\) What is \(E[X \mid Y=2, Z=1]\) ?
An urn contains \(n\) balls, with ball \(i\) having weight \(w_{i}, i=1, \ldots, n .\) The balls are withdrawn from the urn one at a time according to the following scheme: When \(S\) is the set of balls that remains, ball \(i, i \in S\), is the next ball withdrawn with probability \(w_{i} / \sum_{j \in S} w_{j} .\) Find the expected number of balls that are withdrawn before ball \(i, i=1, \ldots, n\).
In a knockout tennis tournament of \(2^{n}\) contestants, the players are paired and play a match. The losers depart, the remaining \(2^{n-1}\) players are paired, and they play a match. This continues for \(n\) rounds, after which a single player remains unbeaten and is declared the winner. Suppose that the contestants are numbered 1 through \(2^{n}\), and that whenever two players contest a match, the lower numbered one wins with probability \(p\). Also suppose that the pairings of the remaining players are always done at random so that all possible pairings for that round are equally likely. (a) What is the probability that player 1 wins the tournament? (b) What is the probability that player 2 wins the tournament? Hint: Imagine that the random pairings are done in advance of the tournament. That is, the first-round pairings are randomly determined; the \(2^{n-1}\) firstround pairs are then themselves randomly paired, with the winners of each pair to play in round 2 ; these \(2^{n-2}\) groupings (of four players each) are then randomly paired, with the winners of each grouping to play in round 3, and so on. Say that players \(i\) and \(j\) are scheduled to meet in round \(k\) if, provided they both win their first \(k-1\) matches, they will meet in round \(k\). Now condition on the round in which players 1 and 2 are scheduled to meet.
What do you think about this solution?
We value your feedback to improve our textbook solutions.