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.
We have trapezoid with congruent legs.
30x + 11y = 2x + 3
28x +11y = 3
Also we have
30x + 11y = 12
We got 2 equations:
30x + 11y = 12
28x +11y = 3 (*-1) -----> -28x -11y = -3
30x + 11y = 12
<u> -28x -11y = -3</u>
2x = 9
x=9/2
30x + 11y = 12 ------> 30*9/2 +11y =12 ------> 135+11y =12, ---> 11y = - 123,
y= - 123/11
Answer:
volume of sphere=4/3 π4³=256/3π ft²
Not sure if that’s right but I hope that helps
1) neither
2) geometric sequence
