Chapter 7: Problem 58
A coin having probability \(p\) of coming up heads is continually flipped until both heads and tails have appeared. Find (a) the expected number of flips; (b) the probability that the last flip lands on heads.
/*! 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 58
A coin having probability \(p\) of coming up heads is continually flipped until both heads and tails have appeared. Find (a) the expected number of flips; (b) the probability that the last flip lands on heads.
All the tools & learning materials you need for study success - in one app.
Get started for free
If \(X\) and \(Y\) are independent and identically distributed with mean \(\mu\) and variance \(\sigma^{2},\) find $$ E\left[(X-Y)^{2}\right] $$
The game of Clue involves 6 suspects, 6 weapons, and 9 rooms. One of each is randomly chosen and the object of the game is to guess the chosen three.(a) How many solutions are possible? In one version of the game, the selection is made and then each of the players is randomly given three of the remaining cards. Let \(S, W\) and \(R\) be, respectively, the numbers of suspects, weapons, and rooms in the set of three cards given to a specified player. Also, let \(X\) denote the number of solutions that are possible after that player observes his or her three cards. (b) Express \(X\) in terms of \(S, W,\) and \(R\) (c) Find \(E[X]\)
In an urn containing \(n\) balls, the \(i\) th ball has weight \(W(i), i=1, \ldots, n .\) The balls are removed without replacement, one at a time, according to the following rule: At each selection, the probability that a given ball in the urn is chosen is equal to its weight divided by the sum of the weights remaining in the urn. For instance, if at some time \(i_{1}, \ldots, i_{r}\) is the set of balls remaining in the urn, then the next selection will be \(i_{j}\) with probability \(W\left(i_{j}\right) / \sum_{k=1}^{r} W\left(i_{k}\right), j=1, \ldots, r .\) Compute the expected number of balls that are withdrawn before ball number 1 is removed.
If \(X\) and \(Y\) have joint density function $$f_{X, Y}(x,
y)=\left\\{\begin{array}{ll} 1 / y, & \text { if } 0
Let \(X_{1}, X_{2}, \ldots\) be a sequence of independent and identically
distributed continuous random variables. Let \(N \geq 2\) be such that
$$
X_{1} \geq X_{2} \geq \dots \geq X_{N-1}
What do you think about this solution?
We value your feedback to improve our textbook solutions.