What Is the Probability of Getting a Head on the First Toss If the Total Is Odd?

  • Thread starter Thread starter naspek
  • Start date Start date
  • Tags Tags
    Probability
naspek
Messages
176
Reaction score
0
Hi all =)

Question...
A fair coin is tossed thrice. Supposed we denote a "head" turning up as 1 and
"tail" as 0. Given that the total on all three tosses is an odd number,
what is the probability that at first toss, we get a "head"?

i don't have any idea to start answering this question..
please guide me.. =)
 
Physics news on Phys.org


Ok our sample space is
\Omega = \{0,1\}^3 = \{(0,0,0),(0,0,1),(0,1,0),(0,1,1),(1,0,0),(1,0,1),(1,1,0),(1,1,1)\}
We assume a fair coin so every outcome is equally likely which gives us the probability function:
p(x) = \frac{1}{8} \qquad \textrm{for all }x \in \Omega
Now we have two events E_1,E_2. Let E_2 denote the event that the total on all three tosses is an odd number. Let E_1 denote the event that on the first toss we get a head. What you want is the conditional probability P(E_1|E_2). List all elements in E_1 and E_2 and you should be able to compute it using the formula:
P(E_1|E_2) = \frac{P(E_1 \cap E_2)}{P(E_2)}
 
Prove $$\int\limits_0^{\sqrt2/4}\frac{1}{\sqrt{x-x^2}}\arcsin\sqrt{\frac{(x-1)\left(x-1+x\sqrt{9-16x}\right)}{1-2x}} \, \mathrm dx = \frac{\pi^2}{8}.$$ Let $$I = \int\limits_0^{\sqrt 2 / 4}\frac{1}{\sqrt{x-x^2}}\arcsin\sqrt{\frac{(x-1)\left(x-1+x\sqrt{9-16x}\right)}{1-2x}} \, \mathrm dx. \tag{1}$$ The representation integral of ##\arcsin## is $$\arcsin u = \int\limits_{0}^{1} \frac{\mathrm dt}{\sqrt{1-t^2}}, \qquad 0 \leqslant u \leqslant 1.$$ Plugging identity above into ##(1)## with ##u...
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