For three fair six-sided dice, the possible sum of the faces rolled can be any digit from 3 to 18.
For instance the minimum sum occurs when all three dices shows 1 (i.e. 1 + 1 + 1 = 3) and the maximum sum occurs when all three dces shows 6 (i.e. 6 + 6 + 6 = 18).
Thus, there are 16 possible sums when three six-sided dice are rolled.
Therefore, from the pigeonhole principle, <span>the minimum number of times you must throw three fair six-sided dice to ensure that the same sum is rolled twice is 16 + 1 = 17 times.
The pigeonhole principle states that </span><span>if n items are put into m containers, with n > m > 0, then at least one container must contain more than one item.
That is for our case, given that there are 16 possible sums when three six-sided dice is rolled, for there to be two same sums, the number of sums will be greater than 16 and the minimum number greater than 16 is 17.
</span>
D. When you do the math, the results to everything should be t=9. D is the only outlier. Therefore, D is the answer in this case.
(Divide then multiply by 100 and you get your answer)
- - Answer: 70%
This is a bit harder. I suggest getting the Domain and Range for the function of x.
If any of these answers have, an infinite domain and (3, infinite) range. That will be your answer.
Your answer is B.
f(x) = 2x²+3 has the same domain and range as x²+3
Answer:
2
Step-by-step explanation:
