Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Let the probability $p_n$ that a family has exactly $n$ children be $\alpha p^n$ when $n\geq1$, and $$p_0=1-\alpha p(1+p+p^2+\cdots).$$ Suppose that all the sex distributions have the same probability. Show that for $k\geq1$ the probability that a family has exactly $k$ boys is $2\alpha p^k/(2-p)^{k+1}$.

share|improve this question
4  
Please don't write your questions as if you are giving us a homework assignment! Show us what you already tried and where you got stuck. –  sxd Nov 26 '11 at 7:45
    
Assuming the probability of a boy being born=probability of a girl being born=1/2, I am getting Required probability$=\Sigma\alpha p^n nCk*(1/2^n)$.,summation over n extending from 1 to infinity.Is it the correct interpretation? –  Anamitra Palit Nov 26 '11 at 8:00
    
Shouldn’t $p_0$ be $1-\alpha(p+p^2+\dots)$? –  Brian M. Scott Nov 26 '11 at 8:16
    
Summation over n should be from k to infinity in my last comment. –  Anamitra Palit Nov 26 '11 at 8:32
    
I have made the correction as suggested by B. M scott –  Anamitra Palit Nov 26 '11 at 11:16
add comment

2 Answers

up vote 4 down vote accepted

Extended hint: We sketch an argument that uses only basic notions. Note that the probability $b_k$ of $k$ boys is, by a conditional probability argument, given by $$b_k=\sum_{n=1}^\infty \alpha p^n \binom{n}{k} \left(\frac{1}{2}\right)^{k}\left(\frac{1}{2}\right)^{n-k}.$$ This simplifies to $$b_k=\sum_{n=1}^\infty \alpha \binom{n}{k}\left(\frac{p}{2}\right)^n.\qquad\qquad(\ast)$$ (We define $\binom{n}{k}$ to be $0$ if $n<k$.) There are many tools for evaluating $(\ast)$. We do it using not much machinery. Recall the combinatorial identity $$\binom{n}{k}=\binom{n-1}{k}+\binom{n-1}{k-1}.$$ Substitute for $\binom{n}{k}$ in $(\ast)$. We obtain $$b_k=\sum_{n=1}^\infty \alpha \binom{n-1}{k}\left(\frac{p}{2}\right)^n +\sum_{n=1}^\infty \alpha \binom{n-1}{k-1}\left(\frac{p}{2}\right)^n.\qquad\qquad(\ast\ast)$$ The first term in $(\ast\ast)$ is just $\dfrac{p}{2}b_k$. The second term is $\dfrac{p}{2}b_{k-1}$. So we have derived the recurrence $$b_k=\frac{p}{2}b_k+\frac{p}{2}b_{k-1}$$ or equivalently $$b_k=\frac{p}{2-p}b_{k-1}.$$ This almost settles things: each time we increment $k$ by $1$, the probability gets multiplied by $\dfrac{p}{2-p}$. To get the process started, we need $b_1$. We have $$b_1=\alpha\sum_{n=1}^\infty n \left(\frac{p}{2}\right)^n.$$ There is a trick for finding $\sum_{n=1}^\infty n x^{n}$. Using the fact that for $|x|<1$, $$1+x+x^2+x^3+ x^4+ \cdots=\frac{1}{1-x},$$ we find, by differentiating, that $$\frac{1}{(1-x)^2}=1+2x+3x^2+ 4x^3+\cdots.$$ It follows that $$x+2x^2+3x^3+4x^4+\cdots =\frac{x}{(1-x)^2}.$$

Comment: Alternately, one could evaluate the sum $(\ast)$ by a repeated differentiation argument that generalizes the method we used for $b_1$.

The recurrence $b_k=\dfrac{p}{2}b_k+\dfrac{p}{2}b_{k-1}$ can also be obtained directly, bypassing the series manipulation.

share|improve this answer
    
+1, Very elegent answer. –  Emmad Kareem Nov 26 '11 at 8:58
    
There is a minor typo:It should be $b_1=\alpha\Sigma_1^{\infty}np^n$. The coefficient $\alpha$ has been left out. This does not reduce the elegance of the proof –  Anamitra Palit Dec 3 '11 at 12:51
    
There is a minor typo:It should be $b_1=\alpha\Sigma_1^{\infty}n(p/2)^n$. The coefficient $\alpha$ has been left out. This does not reduce the elegance of the proof –  Anamitra Palit Dec 3 '11 at 12:58
    
@Anamitra Palit: Thank you for noticing the typo, and telling me about it. Fixed. –  André Nicolas Dec 3 '11 at 15:11
add comment

Required probability=$\alpha \Sigma [(p/2)^n *nCk]$

[Summation on “n” running from k to infinity]

The above expression=$\alpha \Sigma [(k+r) Ck *(p/2)^{k+r} ]$

[Summation on r running from zero to infinity]

Expression =$\alpha (p/2)^k \Sigma (p/2)^r (k+r)Ck$ -------(1)

Now,

$\Sigma (p/2)^r (k+r)Ck$

=The coefficient of $x^k$ in the sum given below:

$(p/2+x)^0+(p/2+x)^1+(p/2+1)^2 ……..$ ------- ---- (2)

[We have an infinite number of terms in the above series].

We choose x such that:

$p<p/2+x<1$ --------[inequality A]

$=>0<p/(2-p)<2x/(2-p)<1$ --------[Inequality B]

The series given by (2) evaluates to

$1/(1-x-p/2) = 2/(2-2x-p)$

$=2(2-2x-p)^{-1}$

$=[2/(2-p)] [1-2x/(2-p)]^{-1}$

Inequality A ensures the convergence of the series expressed by (2).

Coefficient of $x^k$ in the above expression is:

$2/(2-p) 2^k/(2-p)^k$ ----(3)

Inequality B ensures the workability of the binomial expansion to obtain (3)

Using expression (3) in (1) we obtain the probability=

$\alpha (p/2)^k*2/(2-p) 2^k/(2-p)^k$

$=2\alpha p^k/(2-p)^{k+1}$

share|improve this answer
    
Your writing style and presentation leave much to be desired. –  Arturo Magidin Nov 26 '11 at 22:06
    
I have put out my calculations over here just to assert that I have been working on the problem –  Anamitra Palit Dec 3 '11 at 12:55
    
@Anamitra Palit: Nice work. The convergence issues you spent some time on turn out not to matter, since yours is essentially a generating function argument. –  André Nicolas Dec 3 '11 at 15:16
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.