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:
The answer is (4,3)
Step-by-step explanation:
Use desmos graphing calculator, find the points where they meet. Search desmos on google and click on the first link.
Answer:
What are the following?
Step-by-step explanation:
The answer is 1 3/9. The reason is because it repeats 3 so it would be 9 at the bottom.
Answer:
y = 1/2x - 1
Step-by-step explanation:
When you put all three equations from the question into a graph and then input the equation i just gave you it will be perpendicular to line B & C, also it will be parallel to line A. Finally you can check yourself that it also has a y-intercept of (0,-1) & an x-intercept of (2,0). Hopefully this helps out & gets brainliest. xD
