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:
n < - 3 or n > - 2
Step-by-step explanation:
Inequalities of the type | x | > a , have solutions of the form
x < - a or x > a
Then
2n + 5 < - 1 or 2n + 5 > 1
Solve both inequalities
2n + 5 < - 1 ( subtract 5 from both sides )
2n < - 6 ( divide both sides by 2 )
n < - 3
OR
2n + 5 > 1 ( subtract 5 from both sides )
2n > - 4 ( divide both sides by 2 )
n > - 2
Solution is n < - 3 or n > - 2
Answer
3
Step-by-step explanation:
(4-1)^2+(8-8)^2=9
square root of 9 is 3
Answer:
A. A factory worker does not need a lot of education.
Step-by-step explanation:
The answer is " A " which is a factory worker does not need a lot of education. since most people don't have a PHD degree or anything higher education, it results in a lot of people joining due to the benefit of the factory worker doesn't need a lot of worker which makes it low in demand too.
