Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

This looks like a straightforward recurrence, but I have an impression I made a mistake somewhere. In this equation $G_n$ is a random variable

$ G_n=\left\{ \begin{array}{c c} 0 & 1-p_n \\ a_n & p_n \\ \end{array} \right. $

Obviously $\mathbf{E}G_n=a_n p_n$ and border condition is $A_1=1$. So the obvious solution to the problem seems to be

$ A_{n+1}=1+\sum_{j=2}^{n}a_j p_j $

I find this solution way too simple. Do I have to use a generating function somewhere? I had this article in mind when thinking of this problem.

share|cite|improve this question
You should be summing from $j=1$, as $A_2 = A_1 + \mathbb{E}(G_1) = 1 + a_1 p_1$. – Sasha Oct 4 '11 at 14:52
I really fail to see what it is you are asking here ? – Sasha Oct 4 '11 at 14:53
Apart from a typo in the index of summation, the calculation in the post is fine. The answer is simple, there is no need to complicate it. There are enough hard problems. – André Nicolas Oct 4 '11 at 18:43

Your Answer


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

Browse other questions tagged or ask your own question.