Answer:
Step-by-step explanation:
<u>Given ordered pairs:</u>
There is a repeat of domains (3) with different range (-13 and 2) but the function can't have repeat domains so it is not a function
Answer:
I do
Step-by-step explanation:
not know
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.
The answer for this question is 79 :)