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:
61
Step-by-step explanation:
Put 12 where n is, then do the arithmetic.
a(12) = -5 +6(12-1) = 61
_____
We assume you didn't really mean to show an equation for -a(n). If you did, then the term you want is -61.
<span>Fill in the number that makes this sentence true 6x9=(6x5)+(6x) (6x5)</span>
1 mpm or 0.0166666666 repeating mph
Answer:
t+3r
Step-by-step explanation:
This is a one step solution
All you do is add like terms
In this case the only like terms are the varibles r
2r+(t+r)
so if you add all of the rs together there would be 3rs
So the rest of the problem would continue as normal while bringing the 3r to the end
t+3r
