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:
8,107,424
Step-by-step explanation:
The 8,000,000 would stay the same, but the second zero would be switched by a one. The third number would still just be a zero. The other zero would turn into a seven, and the last three numbers would be 4, 2 and 4. You can also find the number by adding.
576 I hope this help cause I did this two years ago so I'm a little rusty but I think this is correct
Answer: replace f(x) with y
.
y=x2+x−30
To find the roots of the equation, replace y
with 0
and solve.
0=x2+x−30
Rewrite the equation as x2+x−30=0
x2+x−30=0
Factor x2+x−30
using the AC method.
(x−5)(x+6)=0
Set x−5
equal to 0 and solve for x
x=5
Set x+6
equal to 0 and solve for x
x=−6
The solution is the result of x−5=0
and x+6=0
x=5,−6
Hope this helps!
