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.
<h2>
Hello!</h2>
The answer is: There are a total of 16 skits in the video.
<h2>Why?</h2>
From the statement, we know that the total length of the video is 101 minutes and it contains a 5-minute introduction, the rest of the minutes are short skits (which are 6 minutes long each one).
So, we need to write the following equations:
First equation:

Second equation:

Where,

So, replacing and substituting the second equation into the first equation we have:

So, there are a total of 16 skits in the video.
Let's prove it substituting "n" into the first equation:

Have a nice day!
Angle p equals 90 degrees so angle a equals 180-90-41=49
Answer:
see explanation
Step-by-step explanation:
let ∠BCE = x then ∠ECD = 5x - 6 and
∠BCE + ∠ECD = ∠BCD, substitute values
x + 5x - 6 = 162, that is
6x - 6 = 162 ( add 6 to both sides )
6x = 168 ( divide both sides by 6 )
x = 28
Hence
∠BCE = x = 28°
∠ECD = 5x - 6 = (5 × 28) - 6 = 140 - 6 = 134°