The number of ways of choosing with parameters

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP












4












$begingroup$



At our disposal is a collection of $10$ red, $11$ blue and $12$ yellow fabrics. (each fabric is unique) In how many ways can we choose $4$ different fabrics if we want at least one fabric of each of the three colors?




My solution was since the first fabric chosen must be red, there are $10$ options for it. Then the next fabric must be blue, which has $11$ options. The third fabric is yellow, with $12$ options, and the last fabric can be any of the colors, provided that it has not already been chosen, so there are $(9+10+11-3)= 30$ ways to choose the last one, making the total number of choices $9cdot 10cdot 11cdot 30$.



My professor said that I needed to divide that by $2$ to get the right answer, but I just don't understand why. Any help would be much appreciated!










share|cite|improve this question











$endgroup$
















    4












    $begingroup$



    At our disposal is a collection of $10$ red, $11$ blue and $12$ yellow fabrics. (each fabric is unique) In how many ways can we choose $4$ different fabrics if we want at least one fabric of each of the three colors?




    My solution was since the first fabric chosen must be red, there are $10$ options for it. Then the next fabric must be blue, which has $11$ options. The third fabric is yellow, with $12$ options, and the last fabric can be any of the colors, provided that it has not already been chosen, so there are $(9+10+11-3)= 30$ ways to choose the last one, making the total number of choices $9cdot 10cdot 11cdot 30$.



    My professor said that I needed to divide that by $2$ to get the right answer, but I just don't understand why. Any help would be much appreciated!










    share|cite|improve this question











    $endgroup$














      4












      4








      4





      $begingroup$



      At our disposal is a collection of $10$ red, $11$ blue and $12$ yellow fabrics. (each fabric is unique) In how many ways can we choose $4$ different fabrics if we want at least one fabric of each of the three colors?




      My solution was since the first fabric chosen must be red, there are $10$ options for it. Then the next fabric must be blue, which has $11$ options. The third fabric is yellow, with $12$ options, and the last fabric can be any of the colors, provided that it has not already been chosen, so there are $(9+10+11-3)= 30$ ways to choose the last one, making the total number of choices $9cdot 10cdot 11cdot 30$.



      My professor said that I needed to divide that by $2$ to get the right answer, but I just don't understand why. Any help would be much appreciated!










      share|cite|improve this question











      $endgroup$





      At our disposal is a collection of $10$ red, $11$ blue and $12$ yellow fabrics. (each fabric is unique) In how many ways can we choose $4$ different fabrics if we want at least one fabric of each of the three colors?




      My solution was since the first fabric chosen must be red, there are $10$ options for it. Then the next fabric must be blue, which has $11$ options. The third fabric is yellow, with $12$ options, and the last fabric can be any of the colors, provided that it has not already been chosen, so there are $(9+10+11-3)= 30$ ways to choose the last one, making the total number of choices $9cdot 10cdot 11cdot 30$.



      My professor said that I needed to divide that by $2$ to get the right answer, but I just don't understand why. Any help would be much appreciated!







      combinatorics discrete-mathematics






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Feb 25 at 13:49









      Vinyl_cape_jawa

      3,34011433




      3,34011433










      asked Feb 25 at 4:56









      cmplxlizcmplxliz

      241




      241




















          2 Answers
          2






          active

          oldest

          votes


















          5












          $begingroup$

          Because under your scheme you would count, for example, both
          $$R1,B1,Y1,R2quadhboxandquad R2,B1,Y1,R1 .$$
          But these are actually the same choice and therefore should not be counted twice.






          share|cite|improve this answer









          $endgroup$




















            3












            $begingroup$

            The total number of ways is $binom 10 2 binom 11 1 binom 12 1 + binom 10 1 binom 11 2 binom 12 1 + binom 10 1 binom 11 1 binom 12 2 = 19800.$






            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%2f3125635%2fthe-number-of-ways-of-choosing-with-parameters%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









              5












              $begingroup$

              Because under your scheme you would count, for example, both
              $$R1,B1,Y1,R2quadhboxandquad R2,B1,Y1,R1 .$$
              But these are actually the same choice and therefore should not be counted twice.






              share|cite|improve this answer









              $endgroup$

















                5












                $begingroup$

                Because under your scheme you would count, for example, both
                $$R1,B1,Y1,R2quadhboxandquad R2,B1,Y1,R1 .$$
                But these are actually the same choice and therefore should not be counted twice.






                share|cite|improve this answer









                $endgroup$















                  5












                  5








                  5





                  $begingroup$

                  Because under your scheme you would count, for example, both
                  $$R1,B1,Y1,R2quadhboxandquad R2,B1,Y1,R1 .$$
                  But these are actually the same choice and therefore should not be counted twice.






                  share|cite|improve this answer









                  $endgroup$



                  Because under your scheme you would count, for example, both
                  $$R1,B1,Y1,R2quadhboxandquad R2,B1,Y1,R1 .$$
                  But these are actually the same choice and therefore should not be counted twice.







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered Feb 25 at 5:02









                  DavidDavid

                  69.5k668130




                  69.5k668130





















                      3












                      $begingroup$

                      The total number of ways is $binom 10 2 binom 11 1 binom 12 1 + binom 10 1 binom 11 2 binom 12 1 + binom 10 1 binom 11 1 binom 12 2 = 19800.$






                      share|cite|improve this answer









                      $endgroup$

















                        3












                        $begingroup$

                        The total number of ways is $binom 10 2 binom 11 1 binom 12 1 + binom 10 1 binom 11 2 binom 12 1 + binom 10 1 binom 11 1 binom 12 2 = 19800.$






                        share|cite|improve this answer









                        $endgroup$















                          3












                          3








                          3





                          $begingroup$

                          The total number of ways is $binom 10 2 binom 11 1 binom 12 1 + binom 10 1 binom 11 2 binom 12 1 + binom 10 1 binom 11 1 binom 12 2 = 19800.$






                          share|cite|improve this answer









                          $endgroup$



                          The total number of ways is $binom 10 2 binom 11 1 binom 12 1 + binom 10 1 binom 11 2 binom 12 1 + binom 10 1 binom 11 1 binom 12 2 = 19800.$







                          share|cite|improve this answer












                          share|cite|improve this answer



                          share|cite|improve this answer










                          answered Feb 25 at 5:28









                          Dbchatto67Dbchatto67

                          2,106320




                          2,106320



























                              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%2f3125635%2fthe-number-of-ways-of-choosing-with-parameters%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

                              How to check contact read email or not when send email to Individual?

                              Displaying single band from multi-band raster using QGIS

                              How many registers does an x86_64 CPU actually have?