Tossing a coin is a binomial experiment.
Now lets say there are 'n' repeated trials to get heads. Each of the trials can result in either a head or a tail.
All of these trials are independent since the result of one trial does not affect the result of the next trial.
Now, for 'n' repeated trials the total number of successes is given by
where 'r' denotes the number of successful results.
In our case 
and 
,
Substituting the values we get,
Therefore, there are 1352078 ways to get heads if a person tosses a coin 23 times.
Answer:
1+7=8
Step-by-step explanation:
I hope it helps
carryonlearning
1. -3x + -6
2. -3x + 9
3. 2x - 6
4. -2x + 6
here u go
The count the number of times the sign changes
that is how many positive roots there are
if you get a number that is ≥2, then count down by 2's ending at 0
sub -x for x and evaluate
count change in sign again
that is how many negative roots there are
if you get a number that is ≥2, then count down by 2's ending at 0
so
-2x^3+3x^2-5x-2=0
-,+,-,-
1 2
2 or 0 positive roots
x to -x
2x^3+3x^2+5x-2=0
+,+,+,-
1
1 negative root
2 or 0 positive roots and 1 negative root
D is answer
Answer:
disjoined am not sure abot the P(A or B)
Step-by-step explanation:
