Staying with the “coin flipping game”, let 'Z 'record the first point in time when some player (either the “Head” player or the “Tail” player) has a lead of $1, and let 'W' record the first point in time when some player has a lead of $2. Find the least numbers n1 and n2 such that, Prob(Z ≤ n1) > 1/2 and Prob(W ≤ n2) > 1/2. What is E(Z)?
Staying with the “coin flipping game”, let 'Z 'record the first point in time when some player (either the “Head” player or the “Tail” player) has a lead of $1, and let 'W' record the first point in time when some player has a lead of $2. Find the least numbers n1 and n2 such that, Prob(Z ≤ n1) > 1/2 and Prob(W ≤ n2) > 1/2. What is E(Z)?
College Algebra
7th Edition
ISBN:9781305115545
Author:James Stewart, Lothar Redlin, Saleem Watson
Publisher:James Stewart, Lothar Redlin, Saleem Watson
Chapter9: Counting And Probability
Section: Chapter Questions
Problem 14T: An unbalanced coin is weighted so that the probability of heads is 0.55. The coin is tossed ten...
Related questions
Question
1) Staying with the “coin flipping game”, let 'Z 'record the first point in time when some player (either the “Head” player or the “Tail” player) has a lead of $1, and let 'W' record the first point in time when some player has a lead of $2. Find the least numbers n1 and n2 such that, Prob(Z ≤ n1) > 1/2 and Prob(W ≤ n2) > 1/2. What is E(Z)?
* PLEASE READ THE PAGE EXPLANING THE COIN FLIPPING GAME !
![# A Random Walk on the Integers
We start with the coin toss game, which uses a coin with probability \( \mathcal{P} \) for Head and probability \( q = 1 - \mathcal{P} \) for Tail. You get a dollar if it comes up Head and lose a dollar if it shows Tail. The coin will be tossed infinitely many times, and the random variable \( X_i \) measures your earnings from the \( i^{th} \) toss:
\[
X_i =
\begin{cases}
1 & \text{if the } i^{th} \text{ toss is Head} \\
-1 & \text{otherwise}
\end{cases}
\]
Your profit (excess of heads over tails) after \( m \) tosses is
\[
S_m = X_1 + \cdots + X_m.
\]
Your progress in this game may be thought of as describing a random walk on the integers.
- **Random Walk on the Line**: Imagine starting at \( S_0 = 0 \). Each toss moves you one integer to the right (Head) or to the left (Tail). Thus \( S_j \) is the position of the walk after the \( j^{th} \) step.
## Positive Paths - The Ballot Theorem
Another way to depict the above walk is in two dimensions, i.e., in the plane: using the x-axis for "time" and the y-axis for the progress of the walk. The sequence of points \((0, 0), (1, S_1), (2, S_2), \ldots , (m, S_m)\) describes the start at \((0, 0\) (at time zero the game is even). After step \( j \), the point has x-coordinate \( j \) and y-coordinate \( S_j = X_1 + \cdots + X_j \). Connect successive points by line segments to create a random walk path with \( m \) steps (start at \( (0,0) \), end at \( (m, S_m) \)).
There are \( 2^m \) such paths (each sequence of \( m \) tosses gives a distinct path). For \( \mathcal{P} = 1/2 \), each of the \( 2^m](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F6971cef0-9a3b-4ce4-80d1-ccd4d229c95d%2F9c1bd328-e2c6-4a88-b15d-80666a87693f%2Fe7lz0hf_processed.png&w=3840&q=75)
Transcribed Image Text:# A Random Walk on the Integers
We start with the coin toss game, which uses a coin with probability \( \mathcal{P} \) for Head and probability \( q = 1 - \mathcal{P} \) for Tail. You get a dollar if it comes up Head and lose a dollar if it shows Tail. The coin will be tossed infinitely many times, and the random variable \( X_i \) measures your earnings from the \( i^{th} \) toss:
\[
X_i =
\begin{cases}
1 & \text{if the } i^{th} \text{ toss is Head} \\
-1 & \text{otherwise}
\end{cases}
\]
Your profit (excess of heads over tails) after \( m \) tosses is
\[
S_m = X_1 + \cdots + X_m.
\]
Your progress in this game may be thought of as describing a random walk on the integers.
- **Random Walk on the Line**: Imagine starting at \( S_0 = 0 \). Each toss moves you one integer to the right (Head) or to the left (Tail). Thus \( S_j \) is the position of the walk after the \( j^{th} \) step.
## Positive Paths - The Ballot Theorem
Another way to depict the above walk is in two dimensions, i.e., in the plane: using the x-axis for "time" and the y-axis for the progress of the walk. The sequence of points \((0, 0), (1, S_1), (2, S_2), \ldots , (m, S_m)\) describes the start at \((0, 0\) (at time zero the game is even). After step \( j \), the point has x-coordinate \( j \) and y-coordinate \( S_j = X_1 + \cdots + X_j \). Connect successive points by line segments to create a random walk path with \( m \) steps (start at \( (0,0) \), end at \( (m, S_m) \)).
There are \( 2^m \) such paths (each sequence of \( m \) tosses gives a distinct path). For \( \mathcal{P} = 1/2 \), each of the \( 2^m
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 4 images
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, statistics and related others by exploring similar questions and additional content below.Recommended textbooks for you
College Algebra
Algebra
ISBN:
9781305115545
Author:
James Stewart, Lothar Redlin, Saleem Watson
Publisher:
Cengage Learning
College Algebra
Algebra
ISBN:
9781305115545
Author:
James Stewart, Lothar Redlin, Saleem Watson
Publisher:
Cengage Learning
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage
Algebra and Trigonometry (MindTap Course List)
Algebra
ISBN:
9781305071742
Author:
James Stewart, Lothar Redlin, Saleem Watson
Publisher:
Cengage Learning
College Algebra (MindTap Course List)
Algebra
ISBN:
9781305652231
Author:
R. David Gustafson, Jeff Hughes
Publisher:
Cengage Learning