Answer:
-1.2 that is the point hope this helps
Step-by-step explanation:
Answer:
n = 1 second formula
n = 0 first formula
Step-by-step explanation:
I answer this in the other question you put, here it is again.
This is easy to get. We know the sequence cause it follows a pattern of 8, so let's try some values of n from 1 to 4, to get those numbers with the first formula:
n = 1,2,3,4
f(1) = 8(1) + 2 = 10
f(2) = 8(2) + 2 = 18
f(3) = 8(3) + 2 = 26
f(4) = 8(4) + 2 = 34
As you can see, with the first formula, the first term is 10, and not 2. The only way to get 2 with n = 1 is with the second formula:
f(1) = 8(1) - 6 = 2
f(2) = 8(2) - 6 = 10
f(3) = 8(3) - 6 = 18
f(4) = 8(4) - 6 = 26
With n = 1, the second formula was better and correct.
The first formula could be right only beggining with n = 0. Here is the proof:
f(0) = 8(0) + 2 = 2
Answer:
Step-by-step explanation:
For any distribution, the sum of the probabilities of all possible outcomes must be 1. In this case, we have to have
We're told that 
, and we're given other probabilities, so we have
The expected number of calls would be
![E[X]=\displaystyle\sum_xx\,P(X=x)](https://tex.z-dn.net/?f=E%5BX%5D%3D%5Cdisplaystyle%5Csum_xx%5C%2CP%28X%3Dx%29)
![E[X]=0\,P(X=0)+1\,P(X=1)+\cdots+4\,P(X=4)](https://tex.z-dn.net/?f=E%5BX%5D%3D0%5C%2CP%28X%3D0%29%2B1%5C%2CP%28X%3D1%29%2B%5Ccdots%2B4%5C%2CP%28X%3D4%29)
![E[X]=1.4](https://tex.z-dn.net/?f=E%5BX%5D%3D1.4)
