How Can I Calculate Probabilities for Event Success Rates?

alexbib
Messages
62
Reaction score
0
I have near to no knowledge of statistics, and I want to build a statistical model that can help me calculate %chance of an event happening in situations of type:

every try has 25% success rate
after 6 tries, what are the probabilities of having succeeded at least 5times? After 12tries?

or

each shot has 42% success rate
after 5 tries, how what are the probabilities of succeding at least 4times?


How can I calculate probabilities like these?
 
Mathematics news on Phys.org
Sounds like you want a binomial model. Given probability of success p and n attempts, the probability of exactly k successes is:

\binom{n}{k}p^k(1-p)^{n-k}

Of course, to figure out the probability of at least k successes, you have to add up these probabilities for every value greater than or equal to k.
 
what does the n above k in brackets mean?
 
\binom{n}{k} is the "binomial coefficient". It is the coefficient of xkyn-k in (x+y)n as well as the kth term in the nth line in Pascal's triangle and can be calculated as \frac{n!}{k!(n-k)!}.

It is sometimes written nCk and our British colleagues seem to refer to it as "n choose k" since it is also the number of different ways one can choose k items from a set of n items.
 
And just in case you do not know what x! means: it means x factorial:

x! = 1\times 2\times 3 \times \ldots \times (x-1) \times x
 
Ok, thanks for explanation!
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top