Probability question related to dice

  • Thread starter Thread starter utkarshakash
  • Start date Start date
  • Tags Tags
    Dice Probability
AI Thread Summary
The discussion revolves around calculating the probability of rolling an even face on a die an odd number of times when thrown n times, where n is odd. The initial approach suggests using combinations to sum probabilities of getting even faces 1, 3, 5, ..., n times, leading to a formula involving binomial coefficients. However, confusion arises regarding the correct summation and interpretation of the problem, with participants noting that the probabilities of odd and even occurrences must sum to 1. Ultimately, it is clarified that the correct probability for the scenario is 1/2, indicating a potential misinterpretation of the question's requirements. The conversation emphasizes the importance of symmetry in probability distribution when analyzing outcomes of die rolls.
utkarshakash
Gold Member
Messages
852
Reaction score
13

Homework Statement


A die is thrown n times(n being odd). The probability that even face turns odd number of times is

Homework Equations



The Attempt at a Solution


The probability that even face appears is 1/2 and odd face appears is 1/2. From any of the n throws, the even face can appear 1, 3, 5 ... or n times. Thus the required probability is
\dfrac{1}{2^n} [^nC_1+^nC_3+^nC_5+...+^nC_n]

But I don't know how to sum this series.
 
Physics news on Phys.org
utkarshakash said:

Homework Statement


A die is thrown n times(n being odd). The probability that even face turns odd number of times is

Homework Equations



The Attempt at a Solution


The probability that even face appears is 1/2 and odd face appears is 1/2. From any of the n throws, the even face can appear 1, 3, 5 ... or n times. Thus the required probability is
\dfrac{1}{2^n} [^nC_1+^nC_3+^nC_5+...+^nC_n]

But I don't know how to sum this series.

Multiply and divide by 2. Then investigate the expansion of ##(1+x)^n## and ##(1-x)^n##.
 
utkarshakash said:

Homework Statement


A die is thrown n times(n being odd). The probability that even face turns odd number of times is
What relationships can you find between that probability and the probability that even faces appear an even number of times?
 
haruspex said:
What relationships can you find between that probability and the probability that even faces appear an even number of times?

They both add up to 1. That's what I can think.
 
utkarshakash said:
They both add up to 1. That's what I can think.
Yes, they add up to 1, but there's another relationship. Try rephrasing one of the two conditions in terms of probability of a number of odd faces. Can you see a useful symmetry?
 
hi utkarshakash! :smile:

as a general rule, if you're stuck, try a simple case and see if you can see a pattern

eg what is the answer for n = 3? :wink:
 
haruspex said:
Yes, they add up to 1, but there's another relationship. Try rephrasing one of the two conditions in terms of probability of a number of odd faces. Can you see a useful symmetry?

I am not able to make out what is wrong in my original solution. For eg- If I take n=3 (as suggested by tiny-tim) then I have to find the probability that even face appears either 1 or 3 times.If it appears 1 times out of 3 throws I can write 3C1(1/2)^3. SUppose instead that if it appears 3 times out of 3 throws, the probability will be 3C3(1/2)^3. Adding the 2 probabilities should give the correct answer.
 
hi utkarshakash! :smile:

ah, but your original question was …
utkarshakash said:
But I don't know how to sum this series.

… and that's what we've all been talking about!
utkarshakash said:
… eg- If I take n=3 (as suggested by tiny-tim) then I have to find the probability that even face appears either 1 or 3 times.If it appears 1 times out of 3 throws I can write 3C1(1/2)^3. SUppose instead that if it appears 3 times out of 3 throws, the probability will be 3C3(1/2)^3. Adding the 2 probabilities should give the correct answer.

and that answer is … ? :wink:
 
tiny-tim said:
hi utkarshakash! :smile:

ah, but your original question was …


… and that's what we've all been talking about!


and that answer is … ? :wink:

(1+x)^n-(1-x)^n=2(C_1x+C_3x^2...) \\<br /> 2^{n-1}=C_1+C_3+C_7...
So the answer should be 2^{n-1}/2^n which unfortunately is incorrect.

The correct answer is \dfrac{1.3.5.7...(2n-1)}{2^n n!}
 
  • #10
utkarshakash said:
(1+x)^n-(1-x)^n=2(C_1x+C_3x^2...) \\<br /> 2^{n-1}=C_1+C_3+C_7...
So the answer should be 2^{n-1}/2^n which unfortunately is incorrect.

The correct answer is \dfrac{1.3.5.7...(2n-1)}{2^n n!}
If that's the answer then I don't think I have understood the question.
The reasoning I was trying to lead you towards is:
- prob of odd number of even throws equals prob of odd number of odd throws, by symmetry
- prob of odd number of odd throws equals prob of even number of even throws since they are the same event
- prob of odd number of even throws and prob of even number of even throws add to 1
Putting those three together we get 1/2.
So I strongly suspect the problem has been misinterpreted somewhere along the line. Is it the exact wording? A translation? Should it be 2n throws?
 
  • #11
haruspex said:
If that's the answer then I don't think I have understood the question.
The reasoning I was trying to lead you towards is:
- prob of odd number of even throws equals prob of odd number of odd throws, by symmetry
- prob of odd number of odd throws equals prob of even number of even throws since they are the same event
- prob of odd number of even throws and prob of even number of even throws add to 1
Putting those three together we get 1/2.
So I strongly suspect the problem has been misinterpreted somewhere along the line. Is it the exact wording? A translation? Should it be 2n throws?

Oh! I'm really sorry as I've made a mistake in posting the correct answer. Actually the correct answer for this question is 1/2 and the answer posted here is the answer of some other question. I apologize for any inconvenience that may have occurred to you.
 
  • #12
utkarshakash said:
Oh! I'm really sorry as I've made a mistake in posting the correct answer. Actually the correct answer for this question is 1/2 and the answer posted here is the answer of some other question. I apologize for any inconvenience that may have occurred to you.

Since people have already told you the answer, I might as well explain one of the other approaches that was suggested to you, but which you seemed to ignore. Let ##S_E = \sum{k} C(n,2k)## and ##S_O = \sum_{k} C(n,2k+1)## be the even and odd sums. We have
0 = (1-1)^n = C(n,0)-C(n,1)+C(n,2)- \cdots = S_E - S_O
and
2^n = (1+1)^n = C(n,0) + C(n,1) + C(n,2) + \cdots = S_E + S_O.
Therefore, ##S_E = S_O = 2^{n-1}##.
 
  • #13
Ray Vickson said:
Since people have already told you the answer, I might as well explain one of the other approaches that was suggested to you, but which you seemed to ignore. Let ##S_E = \sum{k} C(n,2k)## and ##S_O = \sum_{k} C(n,2k+1)## be the even and odd sums. We have
0 = (1-1)^n = C(n,0)-C(n,1)+C(n,2)- \cdots = S_E - S_O
and
2^n = (1+1)^n = C(n,0) + C(n,1) + C(n,2) + \cdots = S_E + S_O.
Therefore, ##S_E = S_O = 2^{n-1}##.

I did not ignore it. I followed this approach to reach at the answer. You should read my previous post.
 
  • #14
another way to show that the odd sum equals the even sum … which is clearer if you use 2n+1 instead of n … is by using the symmetry of nCi:

2n+1C2i+1 = ∑ 2n+1C2(n-i) :wink:
 
Back
Top