Answer:
The manager can select a team in 61425 ways.
Step-by-step explanation:
The order in which the cashiers and the kitchen crews are selected is not important. So we use the combinations formula to solve this question.
Combinations formula:
is the number of different combinations of x objects from a set of n elements, given by the following formula.
In how many ways can the manager select a team?
2 cashiers from a set of 10.
4 kitchen crews from a set of 15. So
The manager can select a team in 61425 ways.
Answer:
3628800
Step-by-step explanation:
There are 10 options for the first number.
That leaves 9 options for the second number.
That leaves 8 options for the third number.
So on and so forth.
The number of ways 10 numbers can be arranged is:
10×9×8×7×6×5×4×3×2×1
= 10!
= 3628800
Answer:
E=1/2mv2, v/10./17
Step-by-step explanation:
<h2>i need brainlest <3</h2>
Step-by-step explanation:
(2m + 4) / 8 = w
2m + 4 = 8w
2m = 8w - 4
m = 4w - 2
Answer:
<h2>6</h2>
Step-by-step explanation:
