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.
So we have lengths a and b and are given:
2a+2b = 66 => a+b = 33 => a= 33-b
a*b = 272
plug in one into the other:
(33-b)b = 272 => -b^2 +33b - 272 = 0
Can be factored as (b-16)(b-17) = 0, if you don't "see" this immediately, use the well known abc formula to find b.
So a=16 and b=17 or vice versa.
Answer:
p=16
Step-by-step explanation:
