Ron, you last wrote to this thread:
in general:
whenever you have Bernoulli trials, also called binomial trials - which means a fixed # of trials with the same probabilities of success and failure every time, like this example - the formula is: (number of ways to choose successes/failures)(p ^ # of successes)((1-p) ^ # of failures). the left-hand coefficient (the # of ways to choose) is a combination, which can be generated with our anagram method or with the traditional 'combinations' formula from algebra.
for instance, if you had to figure the probability of 3 successes out of 5, the front coefficient (in front of the probabilities) would be 5!/(2!3!) = 10.
Can you provide more color on this formula - as it applies to the problem above, for example.
I want to make sure I understand the variables correctly.
(number of ways to choose successes/failures)(p ^ # of successes)((1-p) ^ # of failures)
for this problem, according to the formula above, the equation should look like this right?
1st
# of ways to choose successes = 5, derived as you stated from the 'combinations' formula 5 C 4, which = 5!/(3!2!) or 5
2nd
(p ^ # of successes)((1-p) ^ # of failures)
(.6)^4 x (.4)^1
So, if the question had asked:
For one toss of a certain coin, the probability that the outcome is Heads is 0.2. If the coin is tossed 10 times , which of the following is the probability that the outcome will be heads atleast 3 times?
The answer should be:
1st
10 C 3 = 10!/(7!3!) = 120
2nd
(.2)^3 x (.8)^7
together
HHHTTTTTTT as the single possibility and the 120 as the number of combinations of that possibility.
120 (.2)^3 x (.8)^7
then you would have to add that the combinations of 4H, 5H, 6H...and so on. Is that correct?
if so, my next question is for the " at least" part stated in the question - when do we know to use the OPPOSITE, (1-never) to solve the problem?
Clearly, adding each of those combinations would take way too long.
Thanks in advance.