Answer:
The traveler can plan such a tour in 3003 ways.
Step-by-step explanation:
The order that the cities are chosen is not important, since it is chosen by the company and not by the traveler. 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 this problem, we have that:
Combinations of 5 cities from a set of 15. So

The traveler can plan such a tour in 3003 ways.
Answer:
r = 7.7
Step-by-step explanation:
A = πr²
60π = πr²
r² = 60π/π
r² = 60

r = 7.746
Rounded to tenths:
7.7
Answer:
3:15 pm
Step-by-step explanation:
You can imagine that they go in a circle (we can do whatever we want in theoretical math and physics). By doing so we know we can obtain a cosinusoidal wave by projecting the motion on a plane. Each one of the buses has a period (minimum time after what they're in the same point again). For the first one it's 15 minutes, for the second one it's 20 minutes. We have to take the least common multiple of the periods, that is 75 minutes. So They'll meet every 75 minutes. Add 75 minutes (1h and 15 minutes) to 2pm and there you go.
2.5 miles per hour
Because 3/4 divided by 3/10 is equal to 2.5