Enclave radio problem

It is a perfect, cloudless day... the Sun is warm and welcoming... and today is the day, dear everyone, when John Henry Eden is going to organize the radio's afternoon schedule. All by himself. That's right, no one will help him, he will do it all alone. In today's afternoon schedule, he is planning to play 7 music pieces and 4 brand new speeches. Music and speeches are, of course, unique. And JHE has decided the following:

  • The afternoon program will begin with a speech.

  • The afternoon program will end with a music piece.

  • Between any two speeches, there must be a pause, filled with at least one music piece.

All of a sudden, JHE has started thinking about math, or to be more precise, about discrete math. He is thinking, on how many different ways, he can accomplish organization of today's afternoon program.

And now, dear Brilliant Solvers, it is Your time to shine, help JHE in his math trouble, and let him make today's afternoon program great, once again.


Example:

Available music pieces shall be labelled as { 1, 2, 3, 4, 5, 6, 7 }, whilst available speeches will be labelled as { A, B, C, D }. Here are three (different) example of satisfying ways to organize schedule:

  • A12B34C56D7

  • A12B34C65D7

  • A1234B5C6D7


If there is any questions, they can be asked here .


The answer is 2419200.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

2 solutions

Ivan Koswara
Aug 25, 2016
  1. Note that the conditions means each speech precedes a music piece. (Two speeches cannot be consecutive, and the last one cannot be a speech.) Choose the four music pieces that will be preceded by a speech. One of them must be the first one, so we're picking three out of six: ( 6 3 ) = 20 \binom{6}{3} = 20 ways.
  2. Arrange the four speeches: 4 ! = 24 4! = 24 ways.
  3. Arrange the seven music pieces: 7 ! = 5040 7! = 5040 ways.

It's clear that all of them give a valid schedule, and any schedule can be generated in exactly one way. Thus the total number of schedules is just the product of them all: 20 24 5040 = 2419200 20 \cdot 24 \cdot 5040 = \boxed{2419200} .

Milan Milanic
Aug 24, 2016

Solution:

Firstly, to get the answer, dear Readers, we should find the number of different formats. Now, You may be thinking, "What is format?". Example 1 and 2 have the same format, |**|**|**|* (where | represents any speech and * represents any music piece). Example 3 has the following format: |****|*|*|* .

So we will analyze that. One speech must go on the start and one m.p. must go on end, leaving 3 speeches and 6 m.p. We will "combine" one speech and one m.p. together in the following format: *| that way, there will be 3 music-piece-speech blocks and 3 music pieces left for combining. That ends up to be the standard stars and bars problem. So number of different formats is ( 6 3 ) = 20 \left( \begin{matrix} 6 \\ 3 \end{matrix} \right) = 20 .

Now, in each of those formats, we can spread music pieces and speeches in the same manner. Speeches can be spread on 4 ! = 24 4! = 24 different ways, while music pieces can be on 7 ! = 5040 7! = 5040 . All that, dear Readers, leaves the final solution to be ( 6 3 ) × 4 ! × 7 ! = 2 , 419 , 200 \left( \begin{matrix} 6 \\ 3 \end{matrix} \right) \times 4! \times 7! = \boxed{2,419,200}

Yep , or you can look at problem as being solved by a procedure which applies in an 2 steps such that the result will respect all restrictions/conditions of the problem and will respect also the conditions that it generates all possible solutions and that all solution generated are unique , the procedure being that of firstly generating all possible arrangements of music sheets which are 7! and secondly and of palcing for each of the 7! music sheets some discurses between such the condition is respected. Which gives the result though.

A A - 4 years, 8 months ago

Log in to reply

Yeah. It's cute; like sugar. All of my problems are easy. I ain't expert, I know. Oh well...

It's time to stop with Fallout for now...

Milan Milanic - 4 years, 8 months ago

Btw , cute story and problem. It's certainly not difficult or a very difficult problem but cute problem anyway.

A A - 4 years, 8 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...