26coliflowers
Answer:
Step-by-step explanation:
Answer:
its either 3 or -3 hopefully someone in the comments can tell which
Step-by-step explanation:
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.
![C_{n,x} = \frac{n!}{x!(n-x)!}](https://tex.z-dn.net/?f=C_%7Bn%2Cx%7D%20%3D%20%5Cfrac%7Bn%21%7D%7Bx%21%28n-x%29%21%7D)
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
![T = C_{10,2}*C_{15,4} = \frac{10!}{2!(10-2)!}*\frac{15!}{4!(15-4)!} = 45*1365 = 61425](https://tex.z-dn.net/?f=T%20%3D%20C_%7B10%2C2%7D%2AC_%7B15%2C4%7D%20%3D%20%5Cfrac%7B10%21%7D%7B2%21%2810-2%29%21%7D%2A%5Cfrac%7B15%21%7D%7B4%21%2815-4%29%21%7D%20%3D%2045%2A1365%20%3D%2061425)
The manager can select a team in 61425 ways.
answer:
p = 0
step-by-step explanation:
6 (7-2p) = 12p + 42
42 - 12p = 12p + 42
+12p +12p
_______________
42 = 24p + 42
-42 -42
_____________
0 = 24p
_ ___
24 24
0 = p
<em>hope this helps! ❤ from peachimin (aka kayla)</em>