Answer:
Step-by-step explanation:
<em><u>Given:</u></em>
<em><u>Solve for:</u></em>
<em><u>Solution:</u></em>
(1) Let's move all of components that do not contain (our target) to the right side (notice the change of sign of
from negative to positive):
(2) Let's divide both sides of equation by 4:
(3) Now, we simplify the left side:
This is the solution.
Hope this helps!
:)
Answer:
165 combinations possible
Step-by-step explanation:
This is a combination problem as opposed to a permutation, because the order in which we fill these positions is not important. We are merely looking for how many ways each of these 11 people can be rearranged and matched up with different candidates, each in a different position each time. The formula can be filled in as follows:
₁₁C₃ =
which simplifies to
₁₁C₃ =
The factorial of 8 will cancel out in the numerator and the denominator, leaving you with
₁₁C₃ =
which is 165