Probability proving the series of a pmf converges to a probability.

ryanj123
Messages
24
Reaction score
0

Homework Statement



There are two separate series I'm having trouble with, although they're related.

The scenario: Roll a fair die until a six comes up.

pmf = (5/6)^(x-1) * (1/6)

So first, show the sum from 1 to infinity of p(x) =1

Next, determine P(X=1,3,5,7,...) that it will appear on an odd roll.


Homework Equations



I'm trying to prove 1=sum (5/6)^(x-1) * (1/6)

and sum (5/6)^(2x-1) * (1/6) = ?


The Attempt at a Solution



For the first, I tried induction but got lost along the way.

The second, the back of the book states = 6/11 but getting there sends me back to computing the first series.
 
Physics news on Phys.org
Your first series is a geometric series. What's the sum of 1+a+a^2+a^3+... for a<1? The second series will be a geometric series as well with a different ratio.
 
Dick said:
Your first series is a geometric series. What's the sum of 1+a+a^2+a^3+... for a<1? The second series will be a geometric series as well with a different ratio.

I'm getting sum (1/5)*(5/6)^n

So,

1 = sum (1/5)*(5/6)^n
1 = (1/5) sum (5/6)^n
5 = sum (5/6)^n
5 = (5/6) + (5/6)^2 + (5/6)^3 + ... + (5/6)^n
5 = (5/6)[1 + (5/6) + (5/6)^2 +...+ (5/6)^(n-1)]

Now, I need to show this for n+1.

5 = (5/6)[1 + (5/6) + (5/6)^2 +...+ (5/6)^(n-1)]+(5/6)*(5/6)^(n-1+1)
5 = (5/6)[1 + (5/6) + (5/6)^2 +...+ (5/6)^(n-1)]+(5/6)*(5/6)^n
= 5 + (5/6)(5/6)^n
= 5 + (5/6)^(n+1)
so true for all n.

I'm not sure if that was correct? But I need a derivation instead of the geometric assumption.
 
You don't need induction. Just sum the geometric series. It's not an assumption. It's a fact. Can you write something a little clearer next time?
 
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