Probability - expectation and variance from a coin toss

MeMoses
Messages
127
Reaction score
0

Homework Statement



A coin is flipped repeatedly with probability p of landing on heads each flip.

Calculate the average <n> and the variance \sigma^2 = <n^2> - <n>^2 of the attempt n at which heads appears for the first time.


Homework Equations



\sigma^2 = <n^2> - <n>^2

The Attempt at a Solution


I have the probability that head will appear for the first time on the nth attempt to be p(1-p)^{n-1}. Aside from that I'm not sure where to go.
 
Physics news on Phys.org
Your expression for the probability that the head occurs for the first time on the ##n##th attempt looks correct to me. To find ##\langle n \rangle##, plug your expression into the definition of the expected value:
$$\sum_{n=1}^{\infty} n p(1-p)^{n-1}$$
To evaluate the sum, try to express it in terms of a power series.
 
MeMoses said:

Homework Statement



A coin is flipped repeatedly with probability p of landing on heads each flip.

Calculate the average <n> and the variance \sigma^2 = <n^2> - <n>^2 of the attempt n at which heads appears for the first time.


Homework Equations



\sigma^2 = <n^2> - <n>^2

The Attempt at a Solution


I have the probability that head will appear for the first time on the nth attempt to be p(1-p)^{n-1}. Aside from that I'm not sure where to go.

There are more-or-less standard formulas for sums like ##\sum_{n=1}^{\infty} n x^n## and
##\sum_{n=1}^{\infty} n^2 x^n##. These may be found in books, and in on-line sources. Basically, they are easy to get manually, by looking at ##S(x) = \sum_{n=1}^{\infty} x^n## and then looking at what you get from ##dS/dx##, etc.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top