Answer:
Option 4 :
Step-by-step explanation:
<u>See the attached figure:</u>
To find the vertices of the feasible region, we need to graph the constraints, then find the area included by them, then calculate the vertices which is the intersection between each two of them.
As shown, the shaded area represents the solution of the constraints
So, the vertices of the feasible region are:
Answer:
Step-by-step explanation:
The expected value for a discrete variable is calculated as:
Where and
are the values that the variable can take and
and
are their respective probabilities.
So, a player can win 2 dollars or looses 1 dollar, it means that is equal to 2 and
is equal to -1.
Then, we need to calculated the probability that the player win 2 dollars and the probability that the player loses 1 dollar.
If there are n identical and independent events with a probability p of success and a probability (1-p) of fail, the probability that a events from the n are success are equal to:
Where
So, in this case, n is number of times that the player tosses a die and p is the probability to get a 6. n is equal to 6 and p is equal to 1/6.
Therefore, the probability that a player get at least two times number 6, is calculated as:
On the other hand, the probability that a player don't get at least two times number 6, is calculated as:
Finally, the expected value of the amount that the player wins is:
It means that he can expect to loses 0.2101 dollars.