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.
2x - 4y = 32
2x - 8y = 48
2x - 2x - 4x - (-8y) = 32 - 48
4x = -16
x = -16 ÷ 4
x = -4
substitute your value of x into any of the original equations
2 (-4) - 4y = 32
-8 - 4y = 32
-4y = 32 + 8
-4y = 40
y = 40 ÷ -4
y = -10
Say that taking a quarter of student out of the group will add a quarter present of days for food so by take 20 students out you’ll get 60 days (that’s what I got hope this helps)
Answer:The answer is 11.75
Step-by-step explanation:
