An infinite sequence of independent trails is to be performed

TomJerry
Messages
49
Reaction score
0
Question :
An infinite sequence of independent trails is to be performed . Each trails resulting in a success with probability p and failure with probability 1-p . What is the probability that
i) atleast 1 success occurs in the first n trails ;
ii) exactly k success occur in the first n trails;
ii) all trails result in a success;
Solution
I am using Binomial distribution.

i) I will find the P(X of getting 0 success)
Then P(X>= 1) = 1 - P(X of getting 0 success) [IS THIS CORRECT]

ii) For the 2nd P(X=k) in binomial [AM I CORRECT]

iii) DOnt know how to do this one :confused:
 
Physics news on Phys.org
Hi TomJerry! :smile:

i) yes :smile:

ii) yes, but perhaps you'd better write it in full, so we're sure you know what that means? :wink:

iii) erm :redface: … isn't that just ii) with k = n ? :biggrin:
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.
Back
Top