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:
Inverse of a function
Step-by-step explanation:
If the x- and y-values in each pair of a set of ordered pairs are interchanged, the resulting set of ordered pairs is known as the inverse of a function.
For example, given the following function:
y = 2x
If x=0 → y= 0
If x=1 → y= 2
If x=2 → y= 4
Now, if we find the inverse of the function:
y = 2x → x = 2y → y = x/2
Now:
If x=0 → y= 0
If x=2 → y= 1
If x=4 → y= 2
Comparing both cases, you will notice that the ordered pairs are effectively interchanged.
P = 8/v
1/2 = 8/v
multiply v on both sides
1/2 v = 8
multiply 2/1 on both sides (the reciprocal of (1/2)
v = 16
Letter D
Let's convert the task into an example, simplifyng which will make us able to get the answer.
So, according to the task:
![\sqrt[9]{x} * \sqrt[9]{x} * \sqrt[9]{x} * \sqrt[9]{x} = \sqrt[1/ 9 ]{x} * \sqrt[1/9]{x} * \sqrt[1/9]{x} * \sqrt[1/9]{x}](https://tex.z-dn.net/?f=%20%20%5Csqrt%5B9%5D%7Bx%7D%20%2A%20%20%5Csqrt%5B9%5D%7Bx%7D%20%2A%20%20%5Csqrt%5B9%5D%7Bx%7D%20%2A%20%20%5Csqrt%5B9%5D%7Bx%7D%20%0A%0A%3D%20%20%20%5Csqrt%5B1%2F%209%20%5D%7Bx%7D%20%2A%20%20%5Csqrt%5B1%2F9%5D%7Bx%7D%20%2A%20%20%5Csqrt%5B1%2F9%5D%7Bx%7D%20%2A%20%20%5Csqrt%5B1%2F9%5D%7Bx%7D%20)
Now we can simplify:
![\sqrt[1/9]{x} + 1/9+1/9+1/9 = x^{4/9}](https://tex.z-dn.net/?f=%20%5Csqrt%5B1%2F9%5D%7Bx%7D%20%2B%201%2F9%2B1%2F9%2B1%2F9%0A%0A%3D%20x%5E%7B4%2F9%7D%20)
So the answer is <span>
C:x to the four ninths power</span>