Smoker has two matchboxes

А smoker has two matchboxes in his pocket, each containing $n$ mathes. When he wants to smoke, he selects randomly one of the boxes, and takes a match from it. At some point he finds out, that one of the boxes is empty. What is the probability that in the other box there are exactly $r$ matches left (for $r\in\{0,1,\ldots,n\}$). What about the expected number of the matches in the other box.
 
If $X$ is the random variable "number of matches in the other box", then one directly finds that $$\text{P}(X=r)={2n-r \choose n-r}\frac{1}{2^{2n-r}}$$
 Now we will evaluate $$\text{E}X=\sum_{r=0}^{n}r{2n-r \choose n-r}\frac{1}{2^{2n-r}}$$
 The sum of all probabilities being $1$ means here that $$\sum_{r=0}^{n}{2n-r \choose n-r}\frac{1}{2^{2n-r}}=1 $$
Change the variables $r=n-d$ in the last and and we obtain $$\sum_{d=0}^{n}{n+d \choose d}\frac{1}{2^{n+d}}=1 \ \ \ \ \ \ \  (*)$$ Make the same change in the sum for the expectation $$\text{E}X=\sum_{d=0}^{n}(n-d){n+d \choose d}\frac{1}{2^{n+d}}=n-\sum_{d=0}^{n}d{n+d \choose d}\frac{1}{2^{n+d}}$$
It remains to calculate the last sum which could be rewritten in the form $$\frac{1}{2^n n!}\sum_{d=0}^{n}d\frac{(n+d)!}{2^{d}d!}$$ First of all rewrite $(*)$ in the form
$$\sum_{d=0}^{n}\frac{(n+d)!}{2^d d!}=2^n n!$$
Write the same for $n+1$
$$\sum_{d=0}^{n+1}\frac{(n+d+1)!}{2^d d!}=2^{n+1} (n+1)!$$ and manipulating it we obtain
$$\sum_{d=0}^{n}(n+d+1)\frac{(n+d)!}{2^d d!}+\frac{(2n+2)!}{2^{n+1}(n+1)!}=\sum_{d=0}^{n}d\frac{(n+d)!}{2^d d!}+(n+1)\sum_{d=0}^{n}\frac{(n+d)!}{2^d d!}+\frac{(2n+2)!}{2^{n+1}(n+1)!}=\\= \sum_{d=0}^{n}d\frac{(n+d)!}{2^d d!}+(n+1)2^n n!+\frac{(2n+2)!}{2^{n+1}(n+1)!}=2^{n+1} (n+1)!$$
From the last we find $$ \sum_{d=0}^{n}d{n+d \choose d}\frac{1}{2^{n+d}}=\frac{1}{2^n n!}\left(2^{n+1} (n+1)!-2^n (n+1)!-\frac{(2n+2)!}{2^{n+1}(n+1)!}\right)$$
hence $$\text{E}X=n-\frac{1}{2^n n!}\left(2^n (n+1)!-\frac{(2n+2)!}{2^{n+1}(n+1)!}\right)=n-(n+1)+\frac{(2n+2)!}{2^{2n+1}(n+1)!n!}=\\=-1+\frac{n+1}{4^n}{2n+1\choose n}$$
 Using the Stirling approximation one finds that $$\text{E}X \sim \frac{ 2\sqrt{n}}{\sqrt{\pi}}$$

Comments. One can similarly find the variance of $X$ - just write out $(*)$ for $n+2$ so that squares of $d$ appear.

In essence the problem breaks down to evaluating $$ \sum_{d=0}^{n}d{n+d \choose d}\frac{1}{2^{n+d}}$$ Observe that this is quite easier if the sum was infinite - then this could be obtained from differentiating the series of $(1-s)^{-(n+1)}$ (up to some translation).
Another interesting piece of the problem is the identity $(*)$
$$\sum_{d=0}^{n}{n+d \choose d}\frac{1}{2^{n+d}}=1$$
From probabilistic point of view this is trivial. Is there any other way to evaluate it? This could lead to a different tackling of the previous sum (not using $(*)$). One more thing to note - if the sum in $(*)$ was infinite (it is easier to find as well) it is 2, and up to $n$ it is 1.
Something that could be related is Negative binomial distribution.

Addendum (11/17/2018) Probabilistic expanation of the identity $$ \sum_{d=0}^{n}{n+d \choose d}\frac{1}{2^{n+d}}=\frac{1}{2}\sum_{d=0}^{\infty}{n+d \choose d}\frac{1}{2^{n+d}}.$$ (Based on ideas of Emilian Rogachev)
Consider we perform a walk on the integer points of the Cartesian plane, being allowed only moves up and right. If we count the probability of going through the line $x=n+1$ before we go through $y=n+1$ it is $$ \sum_{d=0}^{n}{n+d \choose d}\frac{1}{2^{n+d+1}}.$$ The probability that we will ever go through $x=n+1$ is $1$ and could be written as $$ \sum_{d=0}^{\infty}{n+d \choose d}\frac{1}{2^{n+d+1}}.$$ However, since everything is symmetric, we see that going through $x=n+1$ before $y=n+1$ is equiprobable with going through $y=n+1$ before $x=n+1$ and since both sum up to $1$, each of those probabilities is $1/2$. So $$\sum_{d=0}^{n}{n+d \choose d}\frac{1}{2^{n+d+1}}=\frac{1}{2}\sum_{d=0}^{\infty}{n+d \choose d}\frac{1}{2^{n+d+1}}.$$

Comments

Post a Comment

Popular posts from this blog

Basel problem type sum, proposed by prof. Skordev

Evaluate $$\sum_{n=1}^{\infty}\frac{1}{2^n n^2}.$$ Proof. The function $$S(x):=\sum_{n=1}^{\infty}\frac{x^n}{ n^2}$$ is well defined for $x\in[-1,1]$ and thus we need to find $S(1/2)$. Using differentiation, we observe that $$S(x)=-\int_0^x\frac{\log(1-t)}{t}\text{d}t.$$ If we make change of variables in the latter integral $t\to 1-t$ we obtain $$S(x)=-\int_{1-x}^1\frac{\log t}{1-t}\text{d}t. \ \ \ \ \ (1)$$ On the other hand, using integration by parts, we obtain $$S(x)=-\int_0^x\log(1-t)\text{d}\log t=-\log t\log(1-t)\Big|_{t=0}^x-\int_0^x\frac{\log t}{1-t}\text{d}t.$$ Notice that $\displaystyle \lim_{t\to 0}\log t \log(1-t)=0$ ($\log (1-t)\sim t$ and then L'Hopital), hence $$S(x)=-\int_0^x\log(1-t)\text{d}\log t=-\log x\log(1-x)-\int_0^x\frac{\log t}{1-t}\text{d}t. \ \ \ \ \ (2)$$ Plugging $x=1/2$ and equating $(1)$ to $(2)$ we obtain $$\int_{1/2}^1\frac{\log(1-t)}{t}\text{d} t-\int_{0}^{1/2}\frac{\log(1-t)}{t}\text{d} t= \log\left(\frac{1}{2}\right)^2.$$ On the ot...
Read more

A problem proposed by prof. Babev

Consider the sequence $$a_n=\int_{n}^{n+1}\frac{\sin^2(\pi t)}{t}\text{d}t.$$ It could be proven that $$\lim_{n\to \infty}n a_n=\frac{1}{2}$$  Now we are going to prove that $$\lim_{n\to\infty}n\left(na_n-\frac{1}{2}\right)=-\frac{1}{4} $$ and show how to derive all such limits. $\textbf{Proof.}$ Since $\displaystyle\int_{n}^{n+1}\sin^2(\pi t)\text{d}{t}=\frac{1}{2}$ (for any $n\in \mathbb{N}$) we can rewrite the limit in question as $$\lim_{n\to \infty}n\left(n\left(\int_{n}^{n+1}\frac{\sin^2(\pi t)}{t}\text{d}t-\int_{n}^{n+1}\frac{\sin^2(\pi t)}{n}\text{d}t\right)\right)=\lim_{n\to \infty}n^2\left(\int_{n}^{n+1}\sin^2(\pi t)\left(\frac{1}{t}-\frac{1}{n}\right)\text{d}t\right)$$ $$=\lim_{n\to \infty}n\left(\int_{n}^{n+1}\sin^2(\pi t)\frac{n-t}{t}\text{d}t\right)$$ Changing the variables $t\to n+s$ and using periodicity of sine, the last simplifies to $$ \lim_{n\to \infty}n\int_{0}^{1}\sin^2(\pi s)\frac{-s}{n+s}\text{d}s$$ Since for $s\in[0,1]$, $\displaystyle \...
Read more

Modification on a sequence from VJIMC

The first two limits of the following problem were proposed at VJIMC, 2005, Category I. The exact value of the last limit was proposed by a user at https://artofproblemsolving.com , where you can also see his solution along other lines.  Let $(x_n)_{n\ge 2}$ be a sequence of real numbers, such that $x_2>0$ and for every $n\ge 2$ holds  $$x_{n+1}=-1+\sqrt[n]{1+nx_n}.$$ Prove consecutively that  $$1)\ \lim_{n\to\infty}x_n=0,\  \ \ 2)\ \lim_{n\to\infty}nx_n=0,\  \ \ 3)\ \lim_{n\to\infty}n^2x_n=4.$$ $\textbf{Proof.}$  $\textbf{1)}$ Clearly all the elements of the sequence are positive. The inequality $-1+\sqrt[n]{1+nx_n}<x_n$ is equivalent to $(1+nx_n)<(1+x_n)^n$, which is seen to be true after expanding, since all the summands on the right are positive. This shows that the sequence is strictly decreasing. Hence $$0<x_{n+1}=-1+\sqrt[n]{1+nx_n}\le -1+\sqrt[n]{1+nx_2},$$ and since the right hand side clearly tends to $0$ we obtain $\displaystyle\lim_...
Read more