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:
Step-by-step explanation:
Equation : 165 = 102 + 1.4K
Define: K is # of kilometers
Solve: 63 = 1.4k, so k = 45
Final answer: 45 kilometers
You haven't shared the possible answers, so the best I can do (which is very good!) is to assume we want to change from base 4 to base 10 and then apply the change of base formula.
Given log-to-the-base-4-of (x+2), we want log-to-the-base-10 of (x+2). Following the change of base formula,
log-to-the-base-4-of (x+2)
log-to-the-base-10 of (x+2) = ------------------------------------
log-to-the-base-4-of-10
Answer:
c
Step-by-step explanation: