Answer:
1771 possible ways
Step-by-step explanation:
In this case, we need to know first how many candidates are in total:
10 + 3 + 10 = 23 candidates in total.
Now, we need to choose 3 of them to receive an award. In this case, we have several scenarios, but as it's an award we can also assume that the order in which the candidates are chosen do not matter, so, the formula to use is the following:
C = m! / n! (m - n)!
Where m is the total candidates and n, is the number of candidates to be chosen. Replacing this data we have:
C = 23! / 3! (23 - 3)!
C = 2.59x10^22 / 6(2.43x10^18)
C = 1771
So we have 1771 ways of choose the candidates.
Answer:
5
Step-by-step explanation:
15a , 10b , and -7b are coefficients.
Answer:
3/5
Step-by-step explanation:
3/5 x 2/5 = 6/25
The answer is the first data set because remember, an outlier is a number in a data set that is extremely far away from all of the other numbers.
You can easily tell which one is the outlier, the first data set's outlier is 13, because it is was placed so far away from the other data points.
We know that the first data set is correct because all of the other data sets have numbers that are clustered together.
~Hope I helped!~
If you cards are only 5,6,7, then the probability of getting even, then even would be zero.
The directions say that the card is not replaced. Therefore, once you pick the 6, there would be no more even cards.
