Find expert advice and community support for all your questions on IDNLearn.com. Ask your questions and receive reliable, detailed answers from our dedicated community of experts.
Sagot :
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:
[tex]C_{n,x}[/tex] is the number of different combinations of x objects from a set of n elements, given by the following formula.
[tex]C_{n,x} = \frac{n!}{x!(n-x)!}[/tex]
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
[tex]T = C_{10,2}*C_{15,4} = \frac{10!}{2!(10-2)!}*\frac{15!}{4!(15-4)!} = 45*1365 = 61425[/tex]
The manager can select a team in 61425 ways.
We appreciate every question and answer you provide. Keep engaging and finding the best solutions. This community is the perfect place to learn and grow together. For clear and precise answers, choose IDNLearn.com. Thanks for stopping by, and come back soon for more valuable insights.
