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:
12 hours
Step-by-step explanation:
Let's set the speed as "s".
Remember that distance = speed * time
So, plugging the numbers given...
7 = s * 8.4
Divide both sides by 8.4
s = 5/6
Now, plug this into the distance = speed * time, with the distance being 10. Set the time as "t"
10 = 5/6 * t
Divide both sides by 5/6
12 = t
So, it would take 12 hours for the snail to crawl 10 miles.
Answer:
<h3>
x = -3/5</h3>
Step-by-step explanation:
x/2 + 4/5 = 1/2
×2 ×2
x + 8/5 = 1
-8/5 -8/5
x = 5/5 - 8/5
x = -3/5
Answer:
Step-by-step explanation:
let the speed of Landon=x
speed of Eduardo=x+9
5x+5(x+9)=135
divide by 5
x+x+9=135/5=27
2x+9=27
2x=27-9
2x=18
x=18/2=9
speed of Landon=9 mph
speed of Eduardo=9+9=18 mph
