number of ways $3$ teachers can be invited for a guest lecturer on $6$ days in a school












0












$begingroup$



In how many ways $3$ teachers can be invited for a guest lecturer on $6$ days in a school so that every teacher is invited at least once (on any given day exactly one teacher is invited)




Try: First Teacher $T_{1}$ has $6$ possiability (In any one of $6$ days)



Second Teacher $T_{2}$ has $5$ Possiability



Third Teacher $T_{3}$ has $4$ possiability



So total $6times 5 times 4 = 120$



But answer given as $540$



Could some help me how to count total ways so the answer is $540$



Thanks in advance






combinatorics







share|cite|improve this question











$endgroup$








  • 3




    $begingroup$
    You are only filling 3 days. You need a guest on all 6 days. So, some teachers will need to repeat. There does not appear to be a further restriction so it could be that all visit twice or one comes four times and the others just once.
    $endgroup$
    – badjohn
    Jan 9 at 9:08
















0












$begingroup$



In how many ways $3$ teachers can be invited for a guest lecturer on $6$ days in a school so that every teacher is invited at least once (on any given day exactly one teacher is invited)




Try: First Teacher $T_{1}$ has $6$ possiability (In any one of $6$ days)



Second Teacher $T_{2}$ has $5$ Possiability



Third Teacher $T_{3}$ has $4$ possiability



So total $6times 5 times 4 = 120$



But answer given as $540$



Could some help me how to count total ways so the answer is $540$



Thanks in advance






combinatorics







share|cite|improve this question











$endgroup$








  • 3




    $begingroup$
    You are only filling 3 days. You need a guest on all 6 days. So, some teachers will need to repeat. There does not appear to be a further restriction so it could be that all visit twice or one comes four times and the others just once.
    $endgroup$
    – badjohn
    Jan 9 at 9:08














0












0








0





$begingroup$



In how many ways $3$ teachers can be invited for a guest lecturer on $6$ days in a school so that every teacher is invited at least once (on any given day exactly one teacher is invited)




Try: First Teacher $T_{1}$ has $6$ possiability (In any one of $6$ days)



Second Teacher $T_{2}$ has $5$ Possiability



Third Teacher $T_{3}$ has $4$ possiability



So total $6times 5 times 4 = 120$



But answer given as $540$



Could some help me how to count total ways so the answer is $540$



Thanks in advance






combinatorics







share|cite|improve this question











$endgroup$





In how many ways $3$ teachers can be invited for a guest lecturer on $6$ days in a school so that every teacher is invited at least once (on any given day exactly one teacher is invited)




Try: First Teacher $T_{1}$ has $6$ possiability (In any one of $6$ days)



Second Teacher $T_{2}$ has $5$ Possiability



Third Teacher $T_{3}$ has $4$ possiability



So total $6times 5 times 4 = 120$



But answer given as $540$



Could some help me how to count total ways so the answer is $540$



Thanks in advance






combinatorics




combinatorics






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 9 at 17:06









user

4,0001627




4,0001627










asked Jan 9 at 9:03









DXTDXT

5,6742630




5,6742630








  • 3




    $begingroup$
    You are only filling 3 days. You need a guest on all 6 days. So, some teachers will need to repeat. There does not appear to be a further restriction so it could be that all visit twice or one comes four times and the others just once.
    $endgroup$
    – badjohn
    Jan 9 at 9:08














  • 3




    $begingroup$
    You are only filling 3 days. You need a guest on all 6 days. So, some teachers will need to repeat. There does not appear to be a further restriction so it could be that all visit twice or one comes four times and the others just once.
    $endgroup$
    – badjohn
    Jan 9 at 9:08








3




3




$begingroup$
You are only filling 3 days. You need a guest on all 6 days. So, some teachers will need to repeat. There does not appear to be a further restriction so it could be that all visit twice or one comes four times and the others just once.
$endgroup$
– badjohn
Jan 9 at 9:08




$begingroup$
You are only filling 3 days. You need a guest on all 6 days. So, some teachers will need to repeat. There does not appear to be a further restriction so it could be that all visit twice or one comes four times and the others just once.
$endgroup$
– badjohn
Jan 9 at 9:08










2 Answers
2






active

oldest

votes


















2












$begingroup$

Undesired events:




  • A single teacher teaches repeately. $3$ ways to do so.

  • Only two teachers. First choose one of the teacher to exclude him/her, and then we avoid two extreme cases where one teacher teaches everyday.


$$3cdot (2^6-2)$$



Hence the undesired outcomes are $$3(2^6-1)$$



Without restriction, we could have $3^6$. Hence



$$3^6-3(2^6-1)=3(3^5-2^6+1)=3(243-64+1)=3(180)=540$$






share|cite|improve this answer









$endgroup$





















    1












    $begingroup$

    The table shows the teacher, the number of visits and the number of ways:
    $$begin{array}{c|c|c|c}
    T_1&T_2&T_3&text{No of visits}\
    hline
    1&1&4&{6choose 1}{5choose 1}=color{red}{30}\
    1&2&3&{6choose 1}{5choose 2}=color{green}{60}\
    1&3&2&{6choose 1}{5choose 3}=color{green}{60}\
    1&4&1&{6choose 1}{5choose 4}=color{red}{30}\
    2&1&3&{6choose 2}{4choose 1}=color{green}{60}\
    2&2&2&{6choose 2}{4choose 2}=color{blue}{90}\
    2&3&1&{6choose 2}{4choose 3}=color{green}{60}\
    3&1&2&{6choose 3}{3choose 1}=color{green}{60}\
    3&2&1&{6choose 3}{3choose 2}=color{green}{60}\
    4&1&1&{6choose 4}{2choose 1}=color{red}{30}\
    hline
    &&&color{red}{90}+color{green}{360}+color{blue}{90}=540.
    end{array}$$






    share|cite|improve this answer









    $endgroup$













      Your Answer





      StackExchange.ifUsing("editor", function () {
      return StackExchange.using("mathjaxEditing", function () {
      StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
      StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
      });
      });
      }, "mathjax-editing");

      StackExchange.ready(function() {
      var channelOptions = {
      tags: "".split(" "),
      id: "69"
      };
      initTagRenderer("".split(" "), "".split(" "), channelOptions);

      StackExchange.using("externalEditor", function() {
      // Have to fire editor after snippets, if snippets enabled
      if (StackExchange.settings.snippets.snippetsEnabled) {
      StackExchange.using("snippets", function() {
      createEditor();
      });
      }
      else {
      createEditor();
      }
      });

      function createEditor() {
      StackExchange.prepareEditor({
      heartbeatType: 'answer',
      autoActivateHeartbeat: false,
      convertImagesToLinks: true,
      noModals: true,
      showLowRepImageUploadWarning: true,
      reputationToPostImages: 10,
      bindNavPrevention: true,
      postfix: "",
      imageUploader: {
      brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
      contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
      allowUrls: true
      },
      noCode: true, onDemand: true,
      discardSelector: ".discard-answer"
      ,immediatelyShowMarkdownHelp:true
      });


      }
      });














      draft saved

      draft discarded


















      StackExchange.ready(
      function () {
      StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3067244%2fnumber-of-ways-3-teachers-can-be-invited-for-a-guest-lecturer-on-6-days-in-a%23new-answer', 'question_page');
      }
      );

      Post as a guest















      Required, but never shown

























      2 Answers
      2






      active

      oldest

      votes








      2 Answers
      2






      active

      oldest

      votes









      active

      oldest

      votes






      active

      oldest

      votes









      2












      $begingroup$

      Undesired events:




      • A single teacher teaches repeately. $3$ ways to do so.

      • Only two teachers. First choose one of the teacher to exclude him/her, and then we avoid two extreme cases where one teacher teaches everyday.


      $$3cdot (2^6-2)$$



      Hence the undesired outcomes are $$3(2^6-1)$$



      Without restriction, we could have $3^6$. Hence



      $$3^6-3(2^6-1)=3(3^5-2^6+1)=3(243-64+1)=3(180)=540$$






      share|cite|improve this answer









      $endgroup$


















        2












        $begingroup$

        Undesired events:




        • A single teacher teaches repeately. $3$ ways to do so.

        • Only two teachers. First choose one of the teacher to exclude him/her, and then we avoid two extreme cases where one teacher teaches everyday.


        $$3cdot (2^6-2)$$



        Hence the undesired outcomes are $$3(2^6-1)$$



        Without restriction, we could have $3^6$. Hence



        $$3^6-3(2^6-1)=3(3^5-2^6+1)=3(243-64+1)=3(180)=540$$






        share|cite|improve this answer









        $endgroup$
















          2












          2








          2





          $begingroup$

          Undesired events:




          • A single teacher teaches repeately. $3$ ways to do so.

          • Only two teachers. First choose one of the teacher to exclude him/her, and then we avoid two extreme cases where one teacher teaches everyday.


          $$3cdot (2^6-2)$$



          Hence the undesired outcomes are $$3(2^6-1)$$



          Without restriction, we could have $3^6$. Hence



          $$3^6-3(2^6-1)=3(3^5-2^6+1)=3(243-64+1)=3(180)=540$$






          share|cite|improve this answer









          $endgroup$



          Undesired events:




          • A single teacher teaches repeately. $3$ ways to do so.

          • Only two teachers. First choose one of the teacher to exclude him/her, and then we avoid two extreme cases where one teacher teaches everyday.


          $$3cdot (2^6-2)$$



          Hence the undesired outcomes are $$3(2^6-1)$$



          Without restriction, we could have $3^6$. Hence



          $$3^6-3(2^6-1)=3(3^5-2^6+1)=3(243-64+1)=3(180)=540$$







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Jan 9 at 9:08









          Siong Thye GohSiong Thye Goh

          101k1466117




          101k1466117























              1












              $begingroup$

              The table shows the teacher, the number of visits and the number of ways:
              $$begin{array}{c|c|c|c}
              T_1&T_2&T_3&text{No of visits}\
              hline
              1&1&4&{6choose 1}{5choose 1}=color{red}{30}\
              1&2&3&{6choose 1}{5choose 2}=color{green}{60}\
              1&3&2&{6choose 1}{5choose 3}=color{green}{60}\
              1&4&1&{6choose 1}{5choose 4}=color{red}{30}\
              2&1&3&{6choose 2}{4choose 1}=color{green}{60}\
              2&2&2&{6choose 2}{4choose 2}=color{blue}{90}\
              2&3&1&{6choose 2}{4choose 3}=color{green}{60}\
              3&1&2&{6choose 3}{3choose 1}=color{green}{60}\
              3&2&1&{6choose 3}{3choose 2}=color{green}{60}\
              4&1&1&{6choose 4}{2choose 1}=color{red}{30}\
              hline
              &&&color{red}{90}+color{green}{360}+color{blue}{90}=540.
              end{array}$$






              share|cite|improve this answer









              $endgroup$


















                1












                $begingroup$

                The table shows the teacher, the number of visits and the number of ways:
                $$begin{array}{c|c|c|c}
                T_1&T_2&T_3&text{No of visits}\
                hline
                1&1&4&{6choose 1}{5choose 1}=color{red}{30}\
                1&2&3&{6choose 1}{5choose 2}=color{green}{60}\
                1&3&2&{6choose 1}{5choose 3}=color{green}{60}\
                1&4&1&{6choose 1}{5choose 4}=color{red}{30}\
                2&1&3&{6choose 2}{4choose 1}=color{green}{60}\
                2&2&2&{6choose 2}{4choose 2}=color{blue}{90}\
                2&3&1&{6choose 2}{4choose 3}=color{green}{60}\
                3&1&2&{6choose 3}{3choose 1}=color{green}{60}\
                3&2&1&{6choose 3}{3choose 2}=color{green}{60}\
                4&1&1&{6choose 4}{2choose 1}=color{red}{30}\
                hline
                &&&color{red}{90}+color{green}{360}+color{blue}{90}=540.
                end{array}$$






                share|cite|improve this answer









                $endgroup$
















                  1












                  1








                  1





                  $begingroup$

                  The table shows the teacher, the number of visits and the number of ways:
                  $$begin{array}{c|c|c|c}
                  T_1&T_2&T_3&text{No of visits}\
                  hline
                  1&1&4&{6choose 1}{5choose 1}=color{red}{30}\
                  1&2&3&{6choose 1}{5choose 2}=color{green}{60}\
                  1&3&2&{6choose 1}{5choose 3}=color{green}{60}\
                  1&4&1&{6choose 1}{5choose 4}=color{red}{30}\
                  2&1&3&{6choose 2}{4choose 1}=color{green}{60}\
                  2&2&2&{6choose 2}{4choose 2}=color{blue}{90}\
                  2&3&1&{6choose 2}{4choose 3}=color{green}{60}\
                  3&1&2&{6choose 3}{3choose 1}=color{green}{60}\
                  3&2&1&{6choose 3}{3choose 2}=color{green}{60}\
                  4&1&1&{6choose 4}{2choose 1}=color{red}{30}\
                  hline
                  &&&color{red}{90}+color{green}{360}+color{blue}{90}=540.
                  end{array}$$






                  share|cite|improve this answer









                  $endgroup$



                  The table shows the teacher, the number of visits and the number of ways:
                  $$begin{array}{c|c|c|c}
                  T_1&T_2&T_3&text{No of visits}\
                  hline
                  1&1&4&{6choose 1}{5choose 1}=color{red}{30}\
                  1&2&3&{6choose 1}{5choose 2}=color{green}{60}\
                  1&3&2&{6choose 1}{5choose 3}=color{green}{60}\
                  1&4&1&{6choose 1}{5choose 4}=color{red}{30}\
                  2&1&3&{6choose 2}{4choose 1}=color{green}{60}\
                  2&2&2&{6choose 2}{4choose 2}=color{blue}{90}\
                  2&3&1&{6choose 2}{4choose 3}=color{green}{60}\
                  3&1&2&{6choose 3}{3choose 1}=color{green}{60}\
                  3&2&1&{6choose 3}{3choose 2}=color{green}{60}\
                  4&1&1&{6choose 4}{2choose 1}=color{red}{30}\
                  hline
                  &&&color{red}{90}+color{green}{360}+color{blue}{90}=540.
                  end{array}$$







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered Jan 9 at 18:19









                  farruhotafarruhota

                  20.1k2738




                  20.1k2738






























                      draft saved

                      draft discarded




















































                      Thanks for contributing an answer to Mathematics Stack Exchange!


                      • Please be sure to answer the question. Provide details and share your research!

                      But avoid …



                      • Asking for help, clarification, or responding to other answers.

                      • Making statements based on opinion; back them up with references or personal experience.


                      Use MathJax to format equations. MathJax reference.


                      To learn more, see our tips on writing great answers.




                      draft saved


                      draft discarded














                      StackExchange.ready(
                      function () {
                      StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3067244%2fnumber-of-ways-3-teachers-can-be-invited-for-a-guest-lecturer-on-6-days-in-a%23new-answer', 'question_page');
                      }
                      );

                      Post as a guest















                      Required, but never shown





















































                      Required, but never shown














                      Required, but never shown












                      Required, but never shown







                      Required, but never shown

































                      Required, but never shown














                      Required, but never shown












                      Required, but never shown







                      Required, but never shown







                      Popular posts from this blog

                      Can a sorcerer learn a 5th-level spell early by creating spell slots using the Font of Magic feature?

                      Image
                      28 6 $begingroup$ Per the Font of Magic feature, sorcerer can use Flexible Casting to create 5th-level spell slots at level 7, even though they are not typically available until level 9. You can transform unexpended sorcery points into one spell slot as a bonus action on your turn. The Creating Spell Slots table shows the cost of creating a spell slot of [5th level is 7] If such a sorcerer levels up while still having this 5th-level spell slot, can they choose a 5th-level spell as the spell they gain upon levelling up? The Spellcasting feature states: Additionally, when you gain a level in this class, you can choose one of the sorcerer spells you know and replace it with another spell from the sorcerer spell list, which also must be of a level for which you have spell slots.
                      Read more

                      ts Property 'filter' does not exist on type '{}'

                      Image
                      1 I'm trying to follow Angular Material guide to create a custom filter for autocomplete input text https://material.angular.io/components/autocomplete/overview This is what I have TS import { Component, OnInit } from '@angular/core'; import { TemplateRef } from '@angular/core'; import { FormControl } from "@angular/forms"; import { Observable } from "rxjs"; import { map, startWith, filter } from 'rxjs/operators'; (...) export class AppComponent implements OnInit { title = 'Your Profile'; displayedColumns: string = ['selected', 'name', 'description', 'pnr']; dataSource = ELEMENT_DATA; myControl = new FormControl(); options: any = ['One', 'Two', 'Three']; filteredOptions:
                      Read more

                      mat-slide-toggle shouldn't change it's state when I click cancel in confirmation window

                      Image
                      1 When I checked the slide toggle it should work as expected. But when I try to uncheck it there is a confirmation window asking if you are sure. When I click cancel in that confirmation window, still the toggle changes to unchecked, which shouldn't happen. It should stay in the same state. Here is my Html and TS Code // html <mat-slide-toggle (change)="change($event)" [checked]="isChecked()" > To-pay </mat-slide-toggle> TS code: // ts change(e) { if(this.checked) { if(confirm("Are you sure")) { console.log("toggle") } else { e.stopPropagation(); console.log("toggle should not change if I click the cancel button") }
                      Read more