In how many ways can we split $6$ toys such that John will receive $2$, Carl and Michael will receive at...












1
















  • In how many ways can we split $6$ toys such that John will receive $2$, Carl and Michael will receive at least one toy?




I'll be using combinations in this case. Let us see how many ways there are to split $6$ boys as seen below



$$binom{6}{2}$$



This represents that John will receive any $2$ toys among $6$ toys. From remaining toys, we can conclude that



$$binom{4}{1}binom{3}{1}$$



We've found the case that Michael and Carl receives only one toy. Now we have to consider that they will receive $2$ toys since it says at least.



$$binom{6}{2}binom{4}{2}binom{2}{2}$$



Finally, I'm combining all these results and we have that



$$binom{6}{2}binom{4}{2}binom{2}{2} + binom{6}{2}binom{4}{1}binom{3}{1} = 90 + 180 = 270$$



I've gone wrong somewhere. Could you assist me with that?






combinations







share|cite|improve this question


















  • 1




    Both Michael and Carl can't get 1 toy each, because then you'd only end up distributing 4 toys, not 6
    – Shubham Johri
    Nov 27 '18 at 19:27
















1
















  • In how many ways can we split $6$ toys such that John will receive $2$, Carl and Michael will receive at least one toy?




I'll be using combinations in this case. Let us see how many ways there are to split $6$ boys as seen below



$$binom{6}{2}$$



This represents that John will receive any $2$ toys among $6$ toys. From remaining toys, we can conclude that



$$binom{4}{1}binom{3}{1}$$



We've found the case that Michael and Carl receives only one toy. Now we have to consider that they will receive $2$ toys since it says at least.



$$binom{6}{2}binom{4}{2}binom{2}{2}$$



Finally, I'm combining all these results and we have that



$$binom{6}{2}binom{4}{2}binom{2}{2} + binom{6}{2}binom{4}{1}binom{3}{1} = 90 + 180 = 270$$



I've gone wrong somewhere. Could you assist me with that?






combinations







share|cite|improve this question


















  • 1




    Both Michael and Carl can't get 1 toy each, because then you'd only end up distributing 4 toys, not 6
    – Shubham Johri
    Nov 27 '18 at 19:27














1












1








1









  • In how many ways can we split $6$ toys such that John will receive $2$, Carl and Michael will receive at least one toy?




I'll be using combinations in this case. Let us see how many ways there are to split $6$ boys as seen below



$$binom{6}{2}$$



This represents that John will receive any $2$ toys among $6$ toys. From remaining toys, we can conclude that



$$binom{4}{1}binom{3}{1}$$



We've found the case that Michael and Carl receives only one toy. Now we have to consider that they will receive $2$ toys since it says at least.



$$binom{6}{2}binom{4}{2}binom{2}{2}$$



Finally, I'm combining all these results and we have that



$$binom{6}{2}binom{4}{2}binom{2}{2} + binom{6}{2}binom{4}{1}binom{3}{1} = 90 + 180 = 270$$



I've gone wrong somewhere. Could you assist me with that?






combinations







share|cite|improve this question















  • In how many ways can we split $6$ toys such that John will receive $2$, Carl and Michael will receive at least one toy?




I'll be using combinations in this case. Let us see how many ways there are to split $6$ boys as seen below



$$binom{6}{2}$$



This represents that John will receive any $2$ toys among $6$ toys. From remaining toys, we can conclude that



$$binom{4}{1}binom{3}{1}$$



We've found the case that Michael and Carl receives only one toy. Now we have to consider that they will receive $2$ toys since it says at least.



$$binom{6}{2}binom{4}{2}binom{2}{2}$$



Finally, I'm combining all these results and we have that



$$binom{6}{2}binom{4}{2}binom{2}{2} + binom{6}{2}binom{4}{1}binom{3}{1} = 90 + 180 = 270$$



I've gone wrong somewhere. Could you assist me with that?






combinations




combinations






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Nov 27 '18 at 19:18









Enzo

996




996








  • 1




    Both Michael and Carl can't get 1 toy each, because then you'd only end up distributing 4 toys, not 6
    – Shubham Johri
    Nov 27 '18 at 19:27














  • 1




    Both Michael and Carl can't get 1 toy each, because then you'd only end up distributing 4 toys, not 6
    – Shubham Johri
    Nov 27 '18 at 19:27








1




1




Both Michael and Carl can't get 1 toy each, because then you'd only end up distributing 4 toys, not 6
– Shubham Johri
Nov 27 '18 at 19:27




Both Michael and Carl can't get 1 toy each, because then you'd only end up distributing 4 toys, not 6
– Shubham Johri
Nov 27 '18 at 19:27










2 Answers
2






active

oldest

votes


















1














Since John receives two toys and Carl and Michael each receive at least one toy, the possible distributions are $(2, 1, 3)$, $(2, 2, 2)$, and $(2, 1, 3)$, where the ordered triple $(J, C, M)$ represents the number of toys received by John, Carl, and Michael, respectively.



If John receives $J = 2$ of the six toys and Carl receives exactly $C$ of the remaining four toys, then Michael will receive all of the remaining $M = 4 - C$ toys. Hence, the number of ways of distributing the toys so that John receives two of the six toys and John and Carl each receive at least one is
$$binom{6}{2}binom{4}{1}binom{3}{3} + binom{6}{2}binom{4}{2}binom{2}{2} + binom{6}{2}binom{4}{3}binom{1}{1}$$






share|cite|improve this answer





























    1














    John get 2, that is ${6choose 2}$.



    Now from the rest of 4 Carl gets:



    $1$ toy, that is ${4choose 1}$ way or



    $3$ toys, that is ${4choose 3}$ ways or



    $2$ toys, that is ${4choose 2}$ ways. So the number of all distributions is $${6choose 2}Big( {4choose 1}+ {4choose 2} + {4choose 3}Big)$$.






    share|cite|improve this answer





















      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%2f3016191%2fin-how-many-ways-can-we-split-6-toys-such-that-john-will-receive-2-carl-and%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









      1














      Since John receives two toys and Carl and Michael each receive at least one toy, the possible distributions are $(2, 1, 3)$, $(2, 2, 2)$, and $(2, 1, 3)$, where the ordered triple $(J, C, M)$ represents the number of toys received by John, Carl, and Michael, respectively.



      If John receives $J = 2$ of the six toys and Carl receives exactly $C$ of the remaining four toys, then Michael will receive all of the remaining $M = 4 - C$ toys. Hence, the number of ways of distributing the toys so that John receives two of the six toys and John and Carl each receive at least one is
      $$binom{6}{2}binom{4}{1}binom{3}{3} + binom{6}{2}binom{4}{2}binom{2}{2} + binom{6}{2}binom{4}{3}binom{1}{1}$$






      share|cite|improve this answer


























        1














        Since John receives two toys and Carl and Michael each receive at least one toy, the possible distributions are $(2, 1, 3)$, $(2, 2, 2)$, and $(2, 1, 3)$, where the ordered triple $(J, C, M)$ represents the number of toys received by John, Carl, and Michael, respectively.



        If John receives $J = 2$ of the six toys and Carl receives exactly $C$ of the remaining four toys, then Michael will receive all of the remaining $M = 4 - C$ toys. Hence, the number of ways of distributing the toys so that John receives two of the six toys and John and Carl each receive at least one is
        $$binom{6}{2}binom{4}{1}binom{3}{3} + binom{6}{2}binom{4}{2}binom{2}{2} + binom{6}{2}binom{4}{3}binom{1}{1}$$






        share|cite|improve this answer
























          1












          1








          1






          Since John receives two toys and Carl and Michael each receive at least one toy, the possible distributions are $(2, 1, 3)$, $(2, 2, 2)$, and $(2, 1, 3)$, where the ordered triple $(J, C, M)$ represents the number of toys received by John, Carl, and Michael, respectively.



          If John receives $J = 2$ of the six toys and Carl receives exactly $C$ of the remaining four toys, then Michael will receive all of the remaining $M = 4 - C$ toys. Hence, the number of ways of distributing the toys so that John receives two of the six toys and John and Carl each receive at least one is
          $$binom{6}{2}binom{4}{1}binom{3}{3} + binom{6}{2}binom{4}{2}binom{2}{2} + binom{6}{2}binom{4}{3}binom{1}{1}$$






          share|cite|improve this answer












          Since John receives two toys and Carl and Michael each receive at least one toy, the possible distributions are $(2, 1, 3)$, $(2, 2, 2)$, and $(2, 1, 3)$, where the ordered triple $(J, C, M)$ represents the number of toys received by John, Carl, and Michael, respectively.



          If John receives $J = 2$ of the six toys and Carl receives exactly $C$ of the remaining four toys, then Michael will receive all of the remaining $M = 4 - C$ toys. Hence, the number of ways of distributing the toys so that John receives two of the six toys and John and Carl each receive at least one is
          $$binom{6}{2}binom{4}{1}binom{3}{3} + binom{6}{2}binom{4}{2}binom{2}{2} + binom{6}{2}binom{4}{3}binom{1}{1}$$







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Nov 27 '18 at 19:28









          N. F. Taussig

          43.5k93355




          43.5k93355























              1














              John get 2, that is ${6choose 2}$.



              Now from the rest of 4 Carl gets:



              $1$ toy, that is ${4choose 1}$ way or



              $3$ toys, that is ${4choose 3}$ ways or



              $2$ toys, that is ${4choose 2}$ ways. So the number of all distributions is $${6choose 2}Big( {4choose 1}+ {4choose 2} + {4choose 3}Big)$$.






              share|cite|improve this answer


























                1














                John get 2, that is ${6choose 2}$.



                Now from the rest of 4 Carl gets:



                $1$ toy, that is ${4choose 1}$ way or



                $3$ toys, that is ${4choose 3}$ ways or



                $2$ toys, that is ${4choose 2}$ ways. So the number of all distributions is $${6choose 2}Big( {4choose 1}+ {4choose 2} + {4choose 3}Big)$$.






                share|cite|improve this answer
























                  1












                  1








                  1






                  John get 2, that is ${6choose 2}$.



                  Now from the rest of 4 Carl gets:



                  $1$ toy, that is ${4choose 1}$ way or



                  $3$ toys, that is ${4choose 3}$ ways or



                  $2$ toys, that is ${4choose 2}$ ways. So the number of all distributions is $${6choose 2}Big( {4choose 1}+ {4choose 2} + {4choose 3}Big)$$.






                  share|cite|improve this answer












                  John get 2, that is ${6choose 2}$.



                  Now from the rest of 4 Carl gets:



                  $1$ toy, that is ${4choose 1}$ way or



                  $3$ toys, that is ${4choose 3}$ ways or



                  $2$ toys, that is ${4choose 2}$ ways. So the number of all distributions is $${6choose 2}Big( {4choose 1}+ {4choose 2} + {4choose 3}Big)$$.







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered Nov 27 '18 at 19:27









                  greedoid

                  37.9k114794




                  37.9k114794






























                      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.





                      Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


                      Please pay close attention to the following guidance:


                      • 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.


                      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%2f3016191%2fin-how-many-ways-can-we-split-6-toys-such-that-john-will-receive-2-carl-and%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

                      Aardman Animations

                      Image
                      Aardman Animations, Ltd. Aardman Animations Tipo privada Atividade Animação em stop-motion , Animação em CGI Fundação 1972 Fundador(es) Peter Lord David Sproxton Sede Bristol, Inglaterra  Reino Unido Proprietário(s) Dreamworks Pessoas-chave Peter Lord David Sproxton Nick Park Divisões Aardman Features Aardman Digital Aardman Commercials Aardman Broadcast Aardman International Aardman Rights Aardman Effects Aardman 3-D Systems Aardman Nathan Love AardBoiled Website oficial aardman.com
                      Read more

                      Are they similar matrix

                      Image
                      0 $begingroup$ Do $begin{bmatrix} 0&i&0\0&0&1\0&0&0 end{bmatrix} $ and $begin{bmatrix} 0&0&0\-i&0&0\0&1&0 end{bmatrix} $ are similar.Is this True/false Clearly both are nilpotent and one is conjucate transpose of other but how to know if they are similar.i'm stuck. Please help me linear-algebra vector-spaces eigenvalues-eigenvectors generalizedeigenvector share | cite | improve this question edited Dec 10 '18 at 6:38 Vasanth Kris asked Dec 10 '18 at 6:19
                      Read more

                      “minimization” problem in Euclidean space related to orthonormal basis

                      Image
                      3 $begingroup$ I have stumbled upon an exercice for second year undegraduate student majoring in economics which I find quite demanding. I have an idea for the solution, but it seems awfully complicated, and I am wondering if there was a simpler way to solve it. This goes as follows: Let $(E, langle, rangle)$ be a euclidean space of dimension $n geq 2$ . 1) For any $x in E$ , show that $||x|| = sqrt{n}$ if and only if there exists $(e_1, dots, e_n)$ an orthonormal basis of $E$ such that $x =e_1+ ldots + e_n$ . 2) For any $(x,y) in E$ , show that $||x|| = sqrt{n}$ , $||y|| = sqrt{frac{n(n+1)(2n+1)}{6}}$ and $langle x,y rangle = frac{n(n+1)}{2}$ if and only if there eixsts $(e_1, ldots, e_n)$ an orthonormal basis of $E$ such that $x = e_1 + ldots + e_n$ and $y = e_1 + 2e_2 + ldots + ne_n$ The first q
                      Read more