Step-by-step explanation:
the solution is found in the images above
Answer:
2
Step-by-step explanation:
it should be point 2 on the number line since the distance between x and 0 is about twice as much as the distance between 0 & 1 this means that x is approximately -2
so,
-2 + 4= 2
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.
Quadrant Four (IV) since the x coordinate is a positive and the y coordinate is a negative.