3 years ago

HURRY PLZ IM ON A TIME LIMIT!!!!

1 answer:

8 0

Answer:

23°

Step-by-step explanation:

If you have any questions about the way I solved it, don't hesitate to ask me in the comments below ;)

You might be interested in

Gekata [30.6K]

X is = 1400. That's the answer

4 0

3 years ago

earnstyle [38]

32 cause it’s 32 it be 32 boo

3 0

3 years ago

Fofino [41]

Answer: I feel the answer is C

Step-by-step explanation:

4 0

3 years ago

Airida [17]

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:

$C_{n,x}$ 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)!}$

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$

The manager can select a team in 61425 ways.

7 0

2 years ago

choli [55]

The vertex is (8,7)
the minimum value is 7
the vertex form is y=(x-8)^2 +7
the minimum value of y=7

i hope this helps!

7 0

3 years ago