Answer:
Step-by-step explanation:
Answer:
I ca
Step-by-step explanation:
can't type so the first one.
<span>Say the code only needed to be one number long. Going from 0-9, there are ten digits. Therefore, there are ten unique codes.
Now say the code has to be two numbers long. There are ten possibilities
for the first digit, 0-9. But the second digit only has nine
possibilities, since each number has to be different. (The first number
might be 0, so the second can only go from 1-9) For each of the first
ten possibilities, there are nine possibilities for the second. We
multiply those two numbers together, 10 * 9, and we get 90.
Now we just extend the logic. The third number only has eight
possibilities, while the fourth number only has seven. 10 * 9 * 8 * 7 =
5040 possible codes. I hope this helped! has a great day! :)</span>
Answer:
Following are the solution to the given question:
Step-by-step explanation:
The population std. dev of the dog weight=8
Calculating the payout w s.t:
![E[netpay]=0=(-5) \times 0.9544+w\times (1-0.9544)\\\\ w =(5 \times \frac{0.9544}{1-0.9544}) =\$ 104.65](https://tex.z-dn.net/?f=E%5Bnetpay%5D%3D0%3D%28-5%29%20%5Ctimes%200.9544%2Bw%5Ctimes%20%281-0.9544%29%5C%5C%5C%5C%20w%20%3D%285%20%5Ctimes%20%5Cfrac%7B0.9544%7D%7B1-0.9544%7D%29%20%3D%5C%24%20104.65)
therefore, we assume that the weight of the dog is a normal distribution with std. deviation that is 8.
