A friend asked me a question today. Consider the following coin flipping game. At round 1 of the game, we have a $100$ fair coins, and we flip them all. If we get any heads, we set those aside, and begin round 2 with the remaining coins. During round $i$ the player gets 2 tries. If the player gets all tails 2 times in a row during any round, then he loses. Also, the game ends if he ends up getting all the $100$ coins flipped to heads. The question is, what is the expected number of coins that the player can get? I am hoping for a closed form solution. I feel like this should have an easy solution, but I don't see it.
2026-04-02 21:01:18.1775163678
Coin Flipping Game
495 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/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 COMBINATORICS
- Using only the digits 2,3,9, how many six-digit numbers can be formed which are divisible by 6?
- The function $f(x)=$ ${b^mx^m}\over(1-bx)^{m+1}$ is a generating function of the sequence $\{a_n\}$. Find the coefficient of $x^n$
- Name of Theorem for Coloring of $\{1, \dots, n\}$
- Hard combinatorial identity: $\sum_{l=0}^p(-1)^l\binom{2l}{l}\binom{k}{p-l}\binom{2k+2l-2p}{k+l-p}^{-1}=4^p\binom{k-1}{p}\binom{2k}{k}^{-1}$
- Algebraic step including finite sum and binomial coefficient
- nth letter of lexicographically ordered substrings
- Count of possible money splits
- Covering vector space over finite field by subspaces
- A certain partition of 28
- Counting argument proof or inductive proof of $F_1 {n \choose1}+...+F_n {n \choose n} = F_{2n}$ where $F_i$ are Fibonacci
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?
If $\ E_r\ $ is the expected number of coins the player gets when he starts with $\ r\ $ coins, then $\ E _0=0, E_1 =\frac{1}{4}\cdot 0 + \frac{3}{4}\cdot 1=\frac{3}{4} \ $, and you can calculate $\ E_1, E_2, \dots, E_{100}\ $ recursively from the formula \begin{eqnarray} E_r &=& \frac{1}{4^r}\cdot 0\ + \frac{2^r+1}{4^r}\sum_\limits{j=1}^r{r \choose j}\left(j+E_{r-j}\right)\\ &=&\left(1+\frac{1}{2^r}\right)\frac{r}{2} +\frac{2^r+1}{4^r}\sum_\limits{j=1}^r {r \choose j}E_{r-j}\ . \end{eqnarray} I doubt if there's a simple closed form expression for $\ E_r\ $. For the first few I get $\ E_2= \frac{55}{32}\approx 1.72, E_3=\frac{5589}{2048}\approx 2.73, E_4=\frac{489,413}{2^{16}}\approx 3.73\ $, and $\ E_{100}\approx 99.7327\ $.
Addendum: In the above analysis I was assuming that the player got two tries in every round, including the first. It wasn't clear to me whether this was the case or not. For the purposes of calculating $\ E_{100}\ $ from the above recursion it has to be assumed that all the games with fewer than $100$ coins are played this way. But if this isn't the case for the actual game, the formula for $\ E_{100}\ $ in terms of $E_0, E_1, \dots, E_{99}\ $ would have to be modified as follows: $$ E_{100}=50 + \frac{1}{2^{100}}\sum_\limits{j=1}^{100} {100 \choose j}E_{100-j}\ .$$ The difference in the numerical value of $\ E_{100}\ $ given by this formula and the previous one is so tiny that my $16$-decimal precision of my calculator wasn't sufficient to detect it.