12 donuts split to 5 childrenWhat is the reasoning behind this combination question?Help on three combinatorics questions?!How do the answers to combinatorial problems change if instead of 4 different objects we have 4 identical ones?Combinatorics: How many ways can 10 candy bars and 8 lollipops be given to five indistinct children?Question about the number of combinations with repetitionStirling number and combination with repetitionCombinatorics Question on distribution of identical and distinct gifts.

Convex hull in a discrete space

Is there a concept of "peer review" in Rabbinical Judaism?

Would you write key signatures for non-conventional scales?

Do interval ratios take overtones into account or solely the fundamental frequency?

Why, even after his imprisonment, people keep calling Hannibal Lecter "Doctor"?

Can someone give the intuition behind Mean Absolute Error and the Median?

12 donuts split to 5 children

When does a Sea Sorcerer choose to use Curse of the Sea's additional effect?

Do wheelchair-accessible aircraft exist?

Does "as soon as" imply simultaneity?

Why is STARTTLS still used?

Clear text passwords in Unix

Is it ok if I haven't decided my research topic when I first meet with a potential phd advisor?

My manager quit. Should I agree to defer wage increase to accommodate budget concerns?

Is it acceptable to say that a reviewer's concern is not going to be addressed because then the paper would be too long?

Are fuzzy sets appreciated by OR community?

Is a PWM required for regenerative braking on a DC Motor?

How can I tell the difference between fishing for rolls and being involved?

How do we know neutrons have no charge?

Another student has been assigned the same MSc thesis as mine (and already defended)

Seventh degree polynomial

Why does my browser attempt to download pages from http://clhs.lisp.se instead of viewing them normally?

I reverse the source code, you reverse the input!

Why would an airline put 15 passengers at once on standby?



12 donuts split to 5 children


What is the reasoning behind this combination question?Help on three combinatorics questions?!How do the answers to combinatorial problems change if instead of 4 different objects we have 4 identical ones?Combinatorics: How many ways can 10 candy bars and 8 lollipops be given to five indistinct children?Question about the number of combinations with repetitionStirling number and combination with repetitionCombinatorics Question on distribution of identical and distinct gifts.






.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty margin-bottom:0;








4












$begingroup$


Suppose you buy 12 identical donuts and wish to give them to the 5 children you are babysitting. How many different ways
can you distribute the donuts if:
(a) there are no restrictions



My answer for this question is,



A) Combination with Repetition: (n+r-1,r) = (12+5-1,5) = (16,5)



B) But some people are getting different answers: (n+r-1,r) = (12+5-1,4) = (16,4)
using the logic:
00|00|0000|000|0
there need to be 4 dividers to divide into 5 groups.



Please tell me which one is the right answer.










share|cite|improve this question











$endgroup$









  • 1




    $begingroup$
    You have slightly misstated (B). Correctly stated it is the right answer: $n+r-1choose r-1$. Take a row of 16 zeros and pick 4. Child A gets the number of 0s to the left of the first picked 0. Child B gets the number strictly between the first and second picked 0s and so on.
    $endgroup$
    – almagest
    8 hours ago






  • 1




    $begingroup$
    Your problem on (A) is that you have muddled $n$ and $r$. It is often expressed as $k$ things between $n$ people or $x_1+dots+x_n=k$ and the answer is $n+k-1choose k$ but here $n$ is playing the role of $r$ and $k$ is playing the role of $n$. Note that $n+k-1choose k=n+k-1choose n-1$. So combination with repetition actually gives the same answer $16choose4=16choose12$.
    $endgroup$
    – almagest
    7 hours ago

















4












$begingroup$


Suppose you buy 12 identical donuts and wish to give them to the 5 children you are babysitting. How many different ways
can you distribute the donuts if:
(a) there are no restrictions



My answer for this question is,



A) Combination with Repetition: (n+r-1,r) = (12+5-1,5) = (16,5)



B) But some people are getting different answers: (n+r-1,r) = (12+5-1,4) = (16,4)
using the logic:
00|00|0000|000|0
there need to be 4 dividers to divide into 5 groups.



Please tell me which one is the right answer.










share|cite|improve this question











$endgroup$









  • 1




    $begingroup$
    You have slightly misstated (B). Correctly stated it is the right answer: $n+r-1choose r-1$. Take a row of 16 zeros and pick 4. Child A gets the number of 0s to the left of the first picked 0. Child B gets the number strictly between the first and second picked 0s and so on.
    $endgroup$
    – almagest
    8 hours ago






  • 1




    $begingroup$
    Your problem on (A) is that you have muddled $n$ and $r$. It is often expressed as $k$ things between $n$ people or $x_1+dots+x_n=k$ and the answer is $n+k-1choose k$ but here $n$ is playing the role of $r$ and $k$ is playing the role of $n$. Note that $n+k-1choose k=n+k-1choose n-1$. So combination with repetition actually gives the same answer $16choose4=16choose12$.
    $endgroup$
    – almagest
    7 hours ago













4












4








4





$begingroup$


Suppose you buy 12 identical donuts and wish to give them to the 5 children you are babysitting. How many different ways
can you distribute the donuts if:
(a) there are no restrictions



My answer for this question is,



A) Combination with Repetition: (n+r-1,r) = (12+5-1,5) = (16,5)



B) But some people are getting different answers: (n+r-1,r) = (12+5-1,4) = (16,4)
using the logic:
00|00|0000|000|0
there need to be 4 dividers to divide into 5 groups.



Please tell me which one is the right answer.










share|cite|improve this question











$endgroup$




Suppose you buy 12 identical donuts and wish to give them to the 5 children you are babysitting. How many different ways
can you distribute the donuts if:
(a) there are no restrictions



My answer for this question is,



A) Combination with Repetition: (n+r-1,r) = (12+5-1,5) = (16,5)



B) But some people are getting different answers: (n+r-1,r) = (12+5-1,4) = (16,4)
using the logic:
00|00|0000|000|0
there need to be 4 dividers to divide into 5 groups.



Please tell me which one is the right answer.







combinatorics discrete-mathematics






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited 6 hours ago









N. F. Taussig

49.4k10 gold badges37 silver badges60 bronze badges




49.4k10 gold badges37 silver badges60 bronze badges










asked 8 hours ago









AlphaDJogAlphaDJog

543 bronze badges




543 bronze badges










  • 1




    $begingroup$
    You have slightly misstated (B). Correctly stated it is the right answer: $n+r-1choose r-1$. Take a row of 16 zeros and pick 4. Child A gets the number of 0s to the left of the first picked 0. Child B gets the number strictly between the first and second picked 0s and so on.
    $endgroup$
    – almagest
    8 hours ago






  • 1




    $begingroup$
    Your problem on (A) is that you have muddled $n$ and $r$. It is often expressed as $k$ things between $n$ people or $x_1+dots+x_n=k$ and the answer is $n+k-1choose k$ but here $n$ is playing the role of $r$ and $k$ is playing the role of $n$. Note that $n+k-1choose k=n+k-1choose n-1$. So combination with repetition actually gives the same answer $16choose4=16choose12$.
    $endgroup$
    – almagest
    7 hours ago












  • 1




    $begingroup$
    You have slightly misstated (B). Correctly stated it is the right answer: $n+r-1choose r-1$. Take a row of 16 zeros and pick 4. Child A gets the number of 0s to the left of the first picked 0. Child B gets the number strictly between the first and second picked 0s and so on.
    $endgroup$
    – almagest
    8 hours ago






  • 1




    $begingroup$
    Your problem on (A) is that you have muddled $n$ and $r$. It is often expressed as $k$ things between $n$ people or $x_1+dots+x_n=k$ and the answer is $n+k-1choose k$ but here $n$ is playing the role of $r$ and $k$ is playing the role of $n$. Note that $n+k-1choose k=n+k-1choose n-1$. So combination with repetition actually gives the same answer $16choose4=16choose12$.
    $endgroup$
    – almagest
    7 hours ago







1




1




$begingroup$
You have slightly misstated (B). Correctly stated it is the right answer: $n+r-1choose r-1$. Take a row of 16 zeros and pick 4. Child A gets the number of 0s to the left of the first picked 0. Child B gets the number strictly between the first and second picked 0s and so on.
$endgroup$
– almagest
8 hours ago




$begingroup$
You have slightly misstated (B). Correctly stated it is the right answer: $n+r-1choose r-1$. Take a row of 16 zeros and pick 4. Child A gets the number of 0s to the left of the first picked 0. Child B gets the number strictly between the first and second picked 0s and so on.
$endgroup$
– almagest
8 hours ago




1




1




$begingroup$
Your problem on (A) is that you have muddled $n$ and $r$. It is often expressed as $k$ things between $n$ people or $x_1+dots+x_n=k$ and the answer is $n+k-1choose k$ but here $n$ is playing the role of $r$ and $k$ is playing the role of $n$. Note that $n+k-1choose k=n+k-1choose n-1$. So combination with repetition actually gives the same answer $16choose4=16choose12$.
$endgroup$
– almagest
7 hours ago




$begingroup$
Your problem on (A) is that you have muddled $n$ and $r$. It is often expressed as $k$ things between $n$ people or $x_1+dots+x_n=k$ and the answer is $n+k-1choose k$ but here $n$ is playing the role of $r$ and $k$ is playing the role of $n$. Note that $n+k-1choose k=n+k-1choose n-1$. So combination with repetition actually gives the same answer $16choose4=16choose12$.
$endgroup$
– almagest
7 hours ago










3 Answers
3






active

oldest

votes


















2














$begingroup$

The correct formula is $$binomn+k-1k-1=binomn+k-1n.$$




To understand why this is, consider $n$ indistinguishable balls, and we need to put them into $k$ groups. Now, imagine for each group, we can separate them with dividers.



From here, we see we need $k-1$ dividers. Let's take a quick example:



How many ways are there to place $5$ indistinguishable balls into $3$ boxes?



Solution. We divide the groups by bars - for example, one possible way is $$**||***$$ As you can see, there are three groups:



  • Group $1$: $2$ balls.

  • Group $2$: $0$ balls.

  • Group $3$: $3$ balls.

Another one would be like $$*|**|**$$ Experimenting with this a bit more, we see that we're just arranging $5$ balls and $2$ dividers, which can be done in $$binom 5+22 = 21 text ways. : square$$




Now, for the general case:



We have to place $n$ balls in $k$ groups, which needs $k-1$ dividers. Then, using the example above, we conclude that there are $$binomn+k-1k-1=binomn+k-1n$$ ways to do this.






share|cite|improve this answer










New contributor



guest is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.





$endgroup$






















    1














    $begingroup$

    Let $x_1, x_2,...,x_5$ be the kids, so we could model this problem as $x_1+x_2+x_3+x_4+x_5=12$ (because the donuts are identical).



    This can be solved with a combination with repetition: $5+12-1choose12$ = $16choose12$.



    Edit:



    Another way of thinking this is suppose we have to place 12 balls in 5 containers. The balls are identical and the containers are not. Say those (°°°°°°°°°°°°) are the 12 balls.



    1. First we take 2 balls and place it in a container. Now we have 12-2
      balls left. We are going to represent this as (°°|°°°°°°°°°°).

    2. Again we take 4 balls and we place them in the second container. Now
      we have °°|°°°°|°°°°°°.

    3. Again we take another 3 balls and we place them in the 3rd
      container: °°|°°°°|°°°|°°°.

    4. Again we take another ball and place it in the 4th container:
      °°|°°°°|°°°|°|°°.


    5. Now we have 2 balls left, which we put them in the 5th container.


    In how many ways can we place the four balls in the 16 spaces we have?






    share|cite|improve this answer











    $endgroup$














    • $begingroup$
      but my q is why is r 12 or 4, should it not be 5 because there are 5 children?
      $endgroup$
      – AlphaDJog
      8 hours ago










    • $begingroup$
      Tim Hortons sells 20 different kinds of donuts and always has at least a dozen of each type available. How many different ways can someone buy a dozen donuts? so in this case would this be (31,11) or (31,12)
      $endgroup$
      – AlphaDJog
      8 hours ago










    • $begingroup$
      Check my edit @SkandanVecham
      $endgroup$
      – Moria
      7 hours ago










    • $begingroup$
      That helps, as to what evers left foes into the last container thank you.
      $endgroup$
      – AlphaDJog
      7 hours ago


















    0














    $begingroup$

    Sounds like you are struggling with a formula. Maybe it will help to change the numbers so you can easily tell what the result will be. Assume there is $1$ kid rather than $5$. Is the correct number of ways to distribute $12$ donuts to $1$ child $binom121$ or $binom120$?






    share|cite|improve this answer









    $endgroup$














    • $begingroup$
      (12,0), but for this q: Tim Hortons sells 20 different kinds of donuts and always has at least a dozen of each type available. How many different ways can someone buy a dozen donuts? Would the answer be (31, 20) or would it be (31,19).
      $endgroup$
      – AlphaDJog
      7 hours ago











    • $begingroup$
      @SkandanVecham Seems that the same stars and bars logic as in B. still applies. I couldn't refute the logic of it for the original question or for this one.
      $endgroup$
      – Mike
      7 hours ago














    Your Answer








    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/4.0/"u003ecc by-sa 4.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%2f3366017%2f12-donuts-split-to-5-children%23new-answer', 'question_page');

    );

    Post as a guest















    Required, but never shown

























    3 Answers
    3






    active

    oldest

    votes








    3 Answers
    3






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    2














    $begingroup$

    The correct formula is $$binomn+k-1k-1=binomn+k-1n.$$




    To understand why this is, consider $n$ indistinguishable balls, and we need to put them into $k$ groups. Now, imagine for each group, we can separate them with dividers.



    From here, we see we need $k-1$ dividers. Let's take a quick example:



    How many ways are there to place $5$ indistinguishable balls into $3$ boxes?



    Solution. We divide the groups by bars - for example, one possible way is $$**||***$$ As you can see, there are three groups:



    • Group $1$: $2$ balls.

    • Group $2$: $0$ balls.

    • Group $3$: $3$ balls.

    Another one would be like $$*|**|**$$ Experimenting with this a bit more, we see that we're just arranging $5$ balls and $2$ dividers, which can be done in $$binom 5+22 = 21 text ways. : square$$




    Now, for the general case:



    We have to place $n$ balls in $k$ groups, which needs $k-1$ dividers. Then, using the example above, we conclude that there are $$binomn+k-1k-1=binomn+k-1n$$ ways to do this.






    share|cite|improve this answer










    New contributor



    guest is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
    Check out our Code of Conduct.





    $endgroup$



















      2














      $begingroup$

      The correct formula is $$binomn+k-1k-1=binomn+k-1n.$$




      To understand why this is, consider $n$ indistinguishable balls, and we need to put them into $k$ groups. Now, imagine for each group, we can separate them with dividers.



      From here, we see we need $k-1$ dividers. Let's take a quick example:



      How many ways are there to place $5$ indistinguishable balls into $3$ boxes?



      Solution. We divide the groups by bars - for example, one possible way is $$**||***$$ As you can see, there are three groups:



      • Group $1$: $2$ balls.

      • Group $2$: $0$ balls.

      • Group $3$: $3$ balls.

      Another one would be like $$*|**|**$$ Experimenting with this a bit more, we see that we're just arranging $5$ balls and $2$ dividers, which can be done in $$binom 5+22 = 21 text ways. : square$$




      Now, for the general case:



      We have to place $n$ balls in $k$ groups, which needs $k-1$ dividers. Then, using the example above, we conclude that there are $$binomn+k-1k-1=binomn+k-1n$$ ways to do this.






      share|cite|improve this answer










      New contributor



      guest is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.





      $endgroup$

















        2














        2










        2







        $begingroup$

        The correct formula is $$binomn+k-1k-1=binomn+k-1n.$$




        To understand why this is, consider $n$ indistinguishable balls, and we need to put them into $k$ groups. Now, imagine for each group, we can separate them with dividers.



        From here, we see we need $k-1$ dividers. Let's take a quick example:



        How many ways are there to place $5$ indistinguishable balls into $3$ boxes?



        Solution. We divide the groups by bars - for example, one possible way is $$**||***$$ As you can see, there are three groups:



        • Group $1$: $2$ balls.

        • Group $2$: $0$ balls.

        • Group $3$: $3$ balls.

        Another one would be like $$*|**|**$$ Experimenting with this a bit more, we see that we're just arranging $5$ balls and $2$ dividers, which can be done in $$binom 5+22 = 21 text ways. : square$$




        Now, for the general case:



        We have to place $n$ balls in $k$ groups, which needs $k-1$ dividers. Then, using the example above, we conclude that there are $$binomn+k-1k-1=binomn+k-1n$$ ways to do this.






        share|cite|improve this answer










        New contributor



        guest is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
        Check out our Code of Conduct.





        $endgroup$



        The correct formula is $$binomn+k-1k-1=binomn+k-1n.$$




        To understand why this is, consider $n$ indistinguishable balls, and we need to put them into $k$ groups. Now, imagine for each group, we can separate them with dividers.



        From here, we see we need $k-1$ dividers. Let's take a quick example:



        How many ways are there to place $5$ indistinguishable balls into $3$ boxes?



        Solution. We divide the groups by bars - for example, one possible way is $$**||***$$ As you can see, there are three groups:



        • Group $1$: $2$ balls.

        • Group $2$: $0$ balls.

        • Group $3$: $3$ balls.

        Another one would be like $$*|**|**$$ Experimenting with this a bit more, we see that we're just arranging $5$ balls and $2$ dividers, which can be done in $$binom 5+22 = 21 text ways. : square$$




        Now, for the general case:



        We have to place $n$ balls in $k$ groups, which needs $k-1$ dividers. Then, using the example above, we conclude that there are $$binomn+k-1k-1=binomn+k-1n$$ ways to do this.







        share|cite|improve this answer










        New contributor



        guest is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
        Check out our Code of Conduct.








        share|cite|improve this answer



        share|cite|improve this answer








        edited 5 hours ago





















        New contributor



        guest is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
        Check out our Code of Conduct.








        answered 6 hours ago









        guestguest

        614 bronze badges




        614 bronze badges




        New contributor



        guest is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
        Check out our Code of Conduct.




        New contributor




        guest is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
        Check out our Code of Conduct.




























            1














            $begingroup$

            Let $x_1, x_2,...,x_5$ be the kids, so we could model this problem as $x_1+x_2+x_3+x_4+x_5=12$ (because the donuts are identical).



            This can be solved with a combination with repetition: $5+12-1choose12$ = $16choose12$.



            Edit:



            Another way of thinking this is suppose we have to place 12 balls in 5 containers. The balls are identical and the containers are not. Say those (°°°°°°°°°°°°) are the 12 balls.



            1. First we take 2 balls and place it in a container. Now we have 12-2
              balls left. We are going to represent this as (°°|°°°°°°°°°°).

            2. Again we take 4 balls and we place them in the second container. Now
              we have °°|°°°°|°°°°°°.

            3. Again we take another 3 balls and we place them in the 3rd
              container: °°|°°°°|°°°|°°°.

            4. Again we take another ball and place it in the 4th container:
              °°|°°°°|°°°|°|°°.


            5. Now we have 2 balls left, which we put them in the 5th container.


            In how many ways can we place the four balls in the 16 spaces we have?






            share|cite|improve this answer











            $endgroup$














            • $begingroup$
              but my q is why is r 12 or 4, should it not be 5 because there are 5 children?
              $endgroup$
              – AlphaDJog
              8 hours ago










            • $begingroup$
              Tim Hortons sells 20 different kinds of donuts and always has at least a dozen of each type available. How many different ways can someone buy a dozen donuts? so in this case would this be (31,11) or (31,12)
              $endgroup$
              – AlphaDJog
              8 hours ago










            • $begingroup$
              Check my edit @SkandanVecham
              $endgroup$
              – Moria
              7 hours ago










            • $begingroup$
              That helps, as to what evers left foes into the last container thank you.
              $endgroup$
              – AlphaDJog
              7 hours ago















            1














            $begingroup$

            Let $x_1, x_2,...,x_5$ be the kids, so we could model this problem as $x_1+x_2+x_3+x_4+x_5=12$ (because the donuts are identical).



            This can be solved with a combination with repetition: $5+12-1choose12$ = $16choose12$.



            Edit:



            Another way of thinking this is suppose we have to place 12 balls in 5 containers. The balls are identical and the containers are not. Say those (°°°°°°°°°°°°) are the 12 balls.



            1. First we take 2 balls and place it in a container. Now we have 12-2
              balls left. We are going to represent this as (°°|°°°°°°°°°°).

            2. Again we take 4 balls and we place them in the second container. Now
              we have °°|°°°°|°°°°°°.

            3. Again we take another 3 balls and we place them in the 3rd
              container: °°|°°°°|°°°|°°°.

            4. Again we take another ball and place it in the 4th container:
              °°|°°°°|°°°|°|°°.


            5. Now we have 2 balls left, which we put them in the 5th container.


            In how many ways can we place the four balls in the 16 spaces we have?






            share|cite|improve this answer











            $endgroup$














            • $begingroup$
              but my q is why is r 12 or 4, should it not be 5 because there are 5 children?
              $endgroup$
              – AlphaDJog
              8 hours ago










            • $begingroup$
              Tim Hortons sells 20 different kinds of donuts and always has at least a dozen of each type available. How many different ways can someone buy a dozen donuts? so in this case would this be (31,11) or (31,12)
              $endgroup$
              – AlphaDJog
              8 hours ago










            • $begingroup$
              Check my edit @SkandanVecham
              $endgroup$
              – Moria
              7 hours ago










            • $begingroup$
              That helps, as to what evers left foes into the last container thank you.
              $endgroup$
              – AlphaDJog
              7 hours ago













            1














            1










            1







            $begingroup$

            Let $x_1, x_2,...,x_5$ be the kids, so we could model this problem as $x_1+x_2+x_3+x_4+x_5=12$ (because the donuts are identical).



            This can be solved with a combination with repetition: $5+12-1choose12$ = $16choose12$.



            Edit:



            Another way of thinking this is suppose we have to place 12 balls in 5 containers. The balls are identical and the containers are not. Say those (°°°°°°°°°°°°) are the 12 balls.



            1. First we take 2 balls and place it in a container. Now we have 12-2
              balls left. We are going to represent this as (°°|°°°°°°°°°°).

            2. Again we take 4 balls and we place them in the second container. Now
              we have °°|°°°°|°°°°°°.

            3. Again we take another 3 balls and we place them in the 3rd
              container: °°|°°°°|°°°|°°°.

            4. Again we take another ball and place it in the 4th container:
              °°|°°°°|°°°|°|°°.


            5. Now we have 2 balls left, which we put them in the 5th container.


            In how many ways can we place the four balls in the 16 spaces we have?






            share|cite|improve this answer











            $endgroup$



            Let $x_1, x_2,...,x_5$ be the kids, so we could model this problem as $x_1+x_2+x_3+x_4+x_5=12$ (because the donuts are identical).



            This can be solved with a combination with repetition: $5+12-1choose12$ = $16choose12$.



            Edit:



            Another way of thinking this is suppose we have to place 12 balls in 5 containers. The balls are identical and the containers are not. Say those (°°°°°°°°°°°°) are the 12 balls.



            1. First we take 2 balls and place it in a container. Now we have 12-2
              balls left. We are going to represent this as (°°|°°°°°°°°°°).

            2. Again we take 4 balls and we place them in the second container. Now
              we have °°|°°°°|°°°°°°.

            3. Again we take another 3 balls and we place them in the 3rd
              container: °°|°°°°|°°°|°°°.

            4. Again we take another ball and place it in the 4th container:
              °°|°°°°|°°°|°|°°.


            5. Now we have 2 balls left, which we put them in the 5th container.


            In how many ways can we place the four balls in the 16 spaces we have?







            share|cite|improve this answer














            share|cite|improve this answer



            share|cite|improve this answer








            edited 7 hours ago

























            answered 8 hours ago









            MoriaMoria

            3551 silver badge13 bronze badges




            3551 silver badge13 bronze badges














            • $begingroup$
              but my q is why is r 12 or 4, should it not be 5 because there are 5 children?
              $endgroup$
              – AlphaDJog
              8 hours ago










            • $begingroup$
              Tim Hortons sells 20 different kinds of donuts and always has at least a dozen of each type available. How many different ways can someone buy a dozen donuts? so in this case would this be (31,11) or (31,12)
              $endgroup$
              – AlphaDJog
              8 hours ago










            • $begingroup$
              Check my edit @SkandanVecham
              $endgroup$
              – Moria
              7 hours ago










            • $begingroup$
              That helps, as to what evers left foes into the last container thank you.
              $endgroup$
              – AlphaDJog
              7 hours ago
















            • $begingroup$
              but my q is why is r 12 or 4, should it not be 5 because there are 5 children?
              $endgroup$
              – AlphaDJog
              8 hours ago










            • $begingroup$
              Tim Hortons sells 20 different kinds of donuts and always has at least a dozen of each type available. How many different ways can someone buy a dozen donuts? so in this case would this be (31,11) or (31,12)
              $endgroup$
              – AlphaDJog
              8 hours ago










            • $begingroup$
              Check my edit @SkandanVecham
              $endgroup$
              – Moria
              7 hours ago










            • $begingroup$
              That helps, as to what evers left foes into the last container thank you.
              $endgroup$
              – AlphaDJog
              7 hours ago















            $begingroup$
            but my q is why is r 12 or 4, should it not be 5 because there are 5 children?
            $endgroup$
            – AlphaDJog
            8 hours ago




            $begingroup$
            but my q is why is r 12 or 4, should it not be 5 because there are 5 children?
            $endgroup$
            – AlphaDJog
            8 hours ago












            $begingroup$
            Tim Hortons sells 20 different kinds of donuts and always has at least a dozen of each type available. How many different ways can someone buy a dozen donuts? so in this case would this be (31,11) or (31,12)
            $endgroup$
            – AlphaDJog
            8 hours ago




            $begingroup$
            Tim Hortons sells 20 different kinds of donuts and always has at least a dozen of each type available. How many different ways can someone buy a dozen donuts? so in this case would this be (31,11) or (31,12)
            $endgroup$
            – AlphaDJog
            8 hours ago












            $begingroup$
            Check my edit @SkandanVecham
            $endgroup$
            – Moria
            7 hours ago




            $begingroup$
            Check my edit @SkandanVecham
            $endgroup$
            – Moria
            7 hours ago












            $begingroup$
            That helps, as to what evers left foes into the last container thank you.
            $endgroup$
            – AlphaDJog
            7 hours ago




            $begingroup$
            That helps, as to what evers left foes into the last container thank you.
            $endgroup$
            – AlphaDJog
            7 hours ago











            0














            $begingroup$

            Sounds like you are struggling with a formula. Maybe it will help to change the numbers so you can easily tell what the result will be. Assume there is $1$ kid rather than $5$. Is the correct number of ways to distribute $12$ donuts to $1$ child $binom121$ or $binom120$?






            share|cite|improve this answer









            $endgroup$














            • $begingroup$
              (12,0), but for this q: Tim Hortons sells 20 different kinds of donuts and always has at least a dozen of each type available. How many different ways can someone buy a dozen donuts? Would the answer be (31, 20) or would it be (31,19).
              $endgroup$
              – AlphaDJog
              7 hours ago











            • $begingroup$
              @SkandanVecham Seems that the same stars and bars logic as in B. still applies. I couldn't refute the logic of it for the original question or for this one.
              $endgroup$
              – Mike
              7 hours ago
















            0














            $begingroup$

            Sounds like you are struggling with a formula. Maybe it will help to change the numbers so you can easily tell what the result will be. Assume there is $1$ kid rather than $5$. Is the correct number of ways to distribute $12$ donuts to $1$ child $binom121$ or $binom120$?






            share|cite|improve this answer









            $endgroup$














            • $begingroup$
              (12,0), but for this q: Tim Hortons sells 20 different kinds of donuts and always has at least a dozen of each type available. How many different ways can someone buy a dozen donuts? Would the answer be (31, 20) or would it be (31,19).
              $endgroup$
              – AlphaDJog
              7 hours ago











            • $begingroup$
              @SkandanVecham Seems that the same stars and bars logic as in B. still applies. I couldn't refute the logic of it for the original question or for this one.
              $endgroup$
              – Mike
              7 hours ago














            0














            0










            0







            $begingroup$

            Sounds like you are struggling with a formula. Maybe it will help to change the numbers so you can easily tell what the result will be. Assume there is $1$ kid rather than $5$. Is the correct number of ways to distribute $12$ donuts to $1$ child $binom121$ or $binom120$?






            share|cite|improve this answer









            $endgroup$



            Sounds like you are struggling with a formula. Maybe it will help to change the numbers so you can easily tell what the result will be. Assume there is $1$ kid rather than $5$. Is the correct number of ways to distribute $12$ donuts to $1$ child $binom121$ or $binom120$?







            share|cite|improve this answer












            share|cite|improve this answer



            share|cite|improve this answer










            answered 7 hours ago









            MikeMike

            11.7k3 gold badges17 silver badges44 bronze badges




            11.7k3 gold badges17 silver badges44 bronze badges














            • $begingroup$
              (12,0), but for this q: Tim Hortons sells 20 different kinds of donuts and always has at least a dozen of each type available. How many different ways can someone buy a dozen donuts? Would the answer be (31, 20) or would it be (31,19).
              $endgroup$
              – AlphaDJog
              7 hours ago











            • $begingroup$
              @SkandanVecham Seems that the same stars and bars logic as in B. still applies. I couldn't refute the logic of it for the original question or for this one.
              $endgroup$
              – Mike
              7 hours ago

















            • $begingroup$
              (12,0), but for this q: Tim Hortons sells 20 different kinds of donuts and always has at least a dozen of each type available. How many different ways can someone buy a dozen donuts? Would the answer be (31, 20) or would it be (31,19).
              $endgroup$
              – AlphaDJog
              7 hours ago











            • $begingroup$
              @SkandanVecham Seems that the same stars and bars logic as in B. still applies. I couldn't refute the logic of it for the original question or for this one.
              $endgroup$
              – Mike
              7 hours ago
















            $begingroup$
            (12,0), but for this q: Tim Hortons sells 20 different kinds of donuts and always has at least a dozen of each type available. How many different ways can someone buy a dozen donuts? Would the answer be (31, 20) or would it be (31,19).
            $endgroup$
            – AlphaDJog
            7 hours ago





            $begingroup$
            (12,0), but for this q: Tim Hortons sells 20 different kinds of donuts and always has at least a dozen of each type available. How many different ways can someone buy a dozen donuts? Would the answer be (31, 20) or would it be (31,19).
            $endgroup$
            – AlphaDJog
            7 hours ago













            $begingroup$
            @SkandanVecham Seems that the same stars and bars logic as in B. still applies. I couldn't refute the logic of it for the original question or for this one.
            $endgroup$
            – Mike
            7 hours ago





            $begingroup$
            @SkandanVecham Seems that the same stars and bars logic as in B. still applies. I couldn't refute the logic of it for the original question or for this one.
            $endgroup$
            – Mike
            7 hours ago



















            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%2f3366017%2f12-donuts-split-to-5-children%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

            Invision Community Contents History See also References External links Navigation menuProprietaryinvisioncommunity.comIPS Community ForumsIPS Community Forumsthis blog entry"License Changes, IP.Board 3.4, and the Future""Interview -- Matt Mecham of Ibforums""CEO Invision Power Board, Matt Mecham Is a Liar, Thief!"IPB License Explanation 1.3, 1.3.1, 2.0, and 2.1ArchivedSecurity Fixes, Updates And Enhancements For IPB 1.3.1Archived"New Demo Accounts - Invision Power Services"the original"New Default Skin"the original"Invision Power Board 3.0.0 and Applications Released"the original"Archived copy"the original"Perpetual licenses being done away with""Release Notes - Invision Power Services""Introducing: IPS Community Suite 4!"Invision Community Release Notes

            Canceling a color specificationRandomly assigning color to Graphics3D objects?Default color for Filling in Mathematica 9Coloring specific elements of sets with a prime modified order in an array plotHow to pick a color differing significantly from the colors already in a given color list?Detection of the text colorColor numbers based on their valueCan color schemes for use with ColorData include opacity specification?My dynamic color schemes

            Ласкавець круглолистий Зміст Опис | Поширення | Галерея | Примітки | Посилання | Навігаційне меню58171138361-22960890446Bupleurum rotundifoliumEuro+Med PlantbasePlants of the World Online — Kew ScienceGermplasm Resources Information Network (GRIN)Ласкавецькн. VI : Літери Ком — Левиправивши або дописавши її