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
![_{r}^{n}\textrm{C}](https://tex.z-dn.net/?f=_%7Br%7D%5E%7Bn%7D%5Ctextrm%7BC%7D)
where 'r' denotes the number of successful results.
In our case
and
,
Substituting the values we get,
![_{11}^{23}\textrm{C}=\frac{23!}{11!\times 12!}](https://tex.z-dn.net/?f=_%7B11%7D%5E%7B23%7D%5Ctextrm%7BC%7D%3D%5Cfrac%7B23%21%7D%7B11%21%5Ctimes%2012%21%7D)
![\frac{23!}{11!\times 12!}=1352078](https://tex.z-dn.net/?f=%5Cfrac%7B23%21%7D%7B11%21%5Ctimes%2012%21%7D%3D1352078)
Therefore, there are 1352078 ways to get heads if a person tosses a coin 23 times.
Answer:
9x + x
Step-by-step explanation: