The game rules are simple. You take one fair coin and flip it. You start counting how many times did you get heads and how many times did you get tails. When the number of tails equal the number of heads, the game finishes. What is the probability that the game carries on forever?
2026-03-27 12:16:18.1774613778
Probability of a game never ending
145 Views Asked by user1096364 https://math.techqa.club/user/user1096364/detail At
1
There are 1 best solutions below
Related Questions in PROBABILITY
- How to prove $\lim_{n \rightarrow\infty} e^{-n}\sum_{k=0}^{n}\frac{n^k}{k!} = \frac{1}{2}$?
- Is this a commonly known paradox?
- What's $P(A_1\cap A_2\cap A_3\cap A_4) $?
- Prove or disprove the following inequality
- Another application of the Central Limit Theorem
- Given is $2$ dimensional random variable $(X,Y)$ with table. Determine the correlation between $X$ and $Y$
- A random point $(a,b)$ is uniformly distributed in a unit square $K=[(u,v):0<u<1,0<v<1]$
- proving Kochen-Stone lemma...
- Solution Check. (Probability)
- Interpreting stationary distribution $P_{\infty}(X,V)$ of a random process
Related Questions in PUZZLE
- Maximum number of guaranteed coins to get in a "30 coins in 3 boxes" puzzle
- Interesting number theoretical game
- Number of divisors 888,888.
- Who has built the house of Mason?
- Is there any tri-angle ?
- In what position , the dogs will reside?
- Number of ways to go from A to I
- Who is the truth teller (logic puzzle)
- How many solutions are there if you draw 14 Crosses in a 6x6 Grid?
- Symmetric latin square diagonal elements
Related Questions in BINOMIAL-DISTRIBUTION
- Given $X$ Poisson, and $f_{Y}(y\mid X = x)$, find $\mathbb{E}[X\mid Y]$
- Estimate the square root of the success probability of a Binomial Distribution.
- Choosing oranges. I'm going to lose my mind
- Probability:Binomial Distribution Mean and Variance Problem
- Probability Bookings in a Hotel
- Using Binomial Distribution to Find the Probability of Two of the Same evnts ocurring
- uniformly most powerful test: binomial distribution
- binomial normal with dependent success probability
- A share price grows $1+\epsilon$ times with prob. $p$ or falls $1-\epsilon$ times with prob. $1-p$ each day, what's its expected value after $n$ days?
- A baseball player hits the ball 35% of the time. In 10 opportunities, what is the probability of connecting more than 2 hits?
Related Questions in PROBABILISTIC-METHOD
- Proof by probabilistic method for coins on chessboard puzzle
- Proving lower bound of row/column occurencies of numbers in 2D n-element grid
- Translating an Arithmetic Progression in $\mathbf Z/p\mathbf Z^*$, how much Overlap is Possible?
- Clique numbers and Theorem 4.5.1 in "The Probabilistic Method" by Alon and Spencer
- $\frac{N}{n}$; probability
- Why a randomly chosen element of a class satisfying property `p`, implies existence of an element of said class that satisfies `p`?
- Expected number of hamiltonian paths in a tournament
- Finding threshold for Erdos-Renyi random graph to be connected using branching process
- Theorem of Hardy & Ramanujan - second moment Method
- Deviating from the mean +-1 variables
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
The probability is zero, as shown by the following simple argument.
For each $n\in\{0,1,2,\dots\}$, let $X_n$ be the quantity (number of heads) - (number of tails) after $n$ flips. WLOG, assume that the first flip is heads, so $X_1=+1$. We will divide the experiment into several "phases" as follows:
Phase 1 starts at the beginning, and ends the first time that $X_n$ hits either $0$ or $2$. If it exits via $0$, then the experiment is over. Otherwise, phase $2$ starts.
Phase $2$ ends the first time that $X_n$ hits either $0$ or $4$.
Phase $3$ ends the first time that $X_n$ hits either $0$ or $8$.
Phase $4$ ends the first time that $X_n$ hits either $0$ or $16$.
$\quad\vdots$
The point is, by symmetry, each phase has a $50\%$ chance to end with $X_n=0$, by symmetry, independently of previous phases. The only way for the number of heads to never equal tails is for the this $50\%$ event to never occur after infinitely many attempts, the probability of which is obviously zero.
To be complete, you need to show each phase is almost surely finite. This is not hard to do. For example, phase $4$ ends if at any point there are $16$ heads in a row, so if you divide all of the flips into disjoint blocks of $16$, there will certainly be a block of $16$ heads.