Answer:
1.9
Step-by-step explanation:
First step would be to separate r from t
Then just insert the numbers
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 equation in standard form:
2x-y-10=0
I think the correct answer from the choices listed above is option C. <span>The graph of a system of equations with the same slope and the same y-intercepts will never have no solutions. Rather, it has an infinite number of solutions since all points of the lines intersects.</span>
