MHB Coin Toss Probability: Comparing $P_n$ and $P_{2n}$ for $2n$ and $4n$ Tosses

  • Thread starter Thread starter anemone
  • Start date Start date
AI Thread Summary
The discussion focuses on comparing the probabilities $P_n$ and $P_{2n}$, where $P_n$ represents the probability of getting exactly $n$ heads in $2n$ tosses of a fair coin, and $P_{2n}$ represents the probability of getting exactly $2n$ heads in $4n$ tosses. It is established that $P_{2n}$ is larger than $P_n$ due to the central limit theorem and the properties of binomial distributions. The probabilities can be calculated using the binomial coefficient and are influenced by the number of trials and successes. The conclusion drawn is that as the number of tosses increases, the distribution of outcomes becomes more concentrated around the expected value, favoring $P_{2n}$. This highlights the effect of increasing trials on the probabilities of achieving a specific number of heads.
anemone
Gold Member
MHB
POTW Director
Messages
3,851
Reaction score
115
Let $n$ be a positive integer. Let $P_n$ be the probability that in $2n$ tosses of a fair coin exactly $n$ heads occur, and $P_{2n}$ the probability that in $4n$ tosses of a fair coin exactly $2n$ heads occur. Which is larger, $P_n$ or $P_{2n}$?

--------------------
Remember to read the http://www.mathhelpboards.com/showthread.php?772-Problem-of-the-Week-%28POTW%29-Procedure-and-Guidelines to find out how to http://www.mathhelpboards.com/forms.php?do=form&fid=2!
 
Last edited:
Physics news on Phys.org
Congratulations to lfdahl for his correct solution!:)

Suggested Solution:

Note that $P_n$ is always larger. Thus, it suffices to show that $P_n$ is a decreasing function of $n$, and for this it suffices to show that $P_n>P_{n+1}$ for all $n$.

We have $P_n={2n \choose n}\left(\dfrac{1}{2} \right)^{2n}$ and $P_{n+1}={2n+2 \choose n+1}\left(\dfrac{1}{2} \right)^{2n+2}$.

So,

$\begin{align*}\dfrac{P_n}{P_{n+1}}&=\dfrac{{2n \choose n}}{{2n+2 \choose n+1}}\dfrac{\left(\dfrac{1}{2} \right)^{2n}}{\left(\dfrac{1}{2} \right)^{2n+2}}\\&=\dfrac{(2n)!}{n!n!}\cdot\dfrac{4(n+1)!(n+1)!}{(2n+2)!}\\&=\dfrac{4(n+1)^2}{(2n+1)(2n+2)}\\&=\dfrac{2n+2}{2n+1}\\&>1\end{align*}$

Thus $P_n>P_{n+1}$ for all $n$. It follows that $Pn>P_m$ whenever $m>n$. In particular, $P_n>P_{2n}$.
 
Back
Top