In how many ways can 9 different books and 17 identical cakes be divided on 6 children, so that each child receive at least one book and one cake?How many ways to divide 5 different books among 3 children so that each child gets at least one book?How many ways can 8 children facing each other in a circle change seats so that each faces a different child.Distribute $n$ identical presents to $k$ children so that each child receives at most $3$ presentsHow Many Ways to distribute six different books among 13 children if no child gets more than one bookCombinatorics: How many ways can 10 candy bars and 8 lollipops be given to five indistinct children?How many different ways can you distribute $5$ apples and $8$ oranges among six children if every child must receive at least one piece of fruit?In how many ways can six different gifts be given to five different children with each child receiving at least one gift?The number of ways in which 10 identical apples can be distributed to six children so that each child receives at least one appleNumber of ways to distribute $10$ different books to three children such that they get $3$, $3$ and $4$Stars and Bars question: You have 12 different toys and 4 children. If each child is to receive 3 toys then how many different ways can this be done?

Is it normal that my co-workers at a fitness company criticize my food choices?

How are passwords stolen from companies if they only store hashes?

What does 高層ビルに何車線もの道路。mean?

How do I hide Chekhov's Gun?

What is "focus distance lower/upper" and how is it different from depth of field?

What is the relationship between relativity and the Doppler effect?

Professor being mistaken for a grad student

Fastest way to pop N items from a large dict

World War I as a war of liberals against authoritarians?

Why do tuner card drivers fail to build after kernel update to 4.4.0-143-generic?

How could a scammer know the apps on my phone / iTunes account?

Are all passive ability checks floors for active ability checks?

Have the tides ever turned twice on any open problem?

As a new Ubuntu desktop 18.04 LTS user, do I need to use ufw for a firewall or is iptables sufficient?

Recruiter wants very extensive technical details about all of my previous work

Is it good practice to use Linear Least-Squares with SMA?

Does multi-classing into Fighter give you heavy armor?

This word with a lot of past tenses

What exactly is this small puffer fish doing and how did it manage to accomplish such a feat?

Is it true that good novels will automatically sell themselves on Amazon (and so on) and there is no need for one to waste time promoting?

"Words were different when they (lived / were living) inside of you"

Is there a hypothetical scenario that would make Earth uninhabitable for humans, but not for (the majority of) other animals?

Is "upgrade" the right word to use in this context?

Describing a chess game in a novel



In how many ways can 9 different books and 17 identical cakes be divided on 6 children, so that each child receive at least one book and one cake?


How many ways to divide 5 different books among 3 children so that each child gets at least one book?How many ways can 8 children facing each other in a circle change seats so that each faces a different child.Distribute $n$ identical presents to $k$ children so that each child receives at most $3$ presentsHow Many Ways to distribute six different books among 13 children if no child gets more than one bookCombinatorics: How many ways can 10 candy bars and 8 lollipops be given to five indistinct children?How many different ways can you distribute $5$ apples and $8$ oranges among six children if every child must receive at least one piece of fruit?In how many ways can six different gifts be given to five different children with each child receiving at least one gift?The number of ways in which 10 identical apples can be distributed to six children so that each child receives at least one appleNumber of ways to distribute $10$ different books to three children such that they get $3$, $3$ and $4$Stars and Bars question: You have 12 different toys and 4 children. If each child is to receive 3 toys then how many different ways can this be done?













2












$begingroup$


I'm trying to learn how to count but I'm having some problem.



The problem: In how many ways can $9$ different books and $17$ identical cakes be divided on $6$ (different) children, so that each child receive at least one book and one cake?



I got: The number of ways to divide $6$ different books on $6$ different children is the same as finding all surjective functions from a set $X$, with $|X|=9$ to set $Y$, where $|6|$. The number is $6!×S(9,6)$.



The number of ways to divide $17$ identical cakes on $6$ different children (here is where I am wrong) should in my mind be, after you give out one cake to each child, an unordered sequence with repetition: $binom11+6-16$. However this is wrong, the right answer here is $binom11+6-15$. Can someone please explain that last step to me?










share|cite|improve this question











$endgroup$
















    2












    $begingroup$


    I'm trying to learn how to count but I'm having some problem.



    The problem: In how many ways can $9$ different books and $17$ identical cakes be divided on $6$ (different) children, so that each child receive at least one book and one cake?



    I got: The number of ways to divide $6$ different books on $6$ different children is the same as finding all surjective functions from a set $X$, with $|X|=9$ to set $Y$, where $|6|$. The number is $6!×S(9,6)$.



    The number of ways to divide $17$ identical cakes on $6$ different children (here is where I am wrong) should in my mind be, after you give out one cake to each child, an unordered sequence with repetition: $binom11+6-16$. However this is wrong, the right answer here is $binom11+6-15$. Can someone please explain that last step to me?










    share|cite|improve this question











    $endgroup$














      2












      2








      2





      $begingroup$


      I'm trying to learn how to count but I'm having some problem.



      The problem: In how many ways can $9$ different books and $17$ identical cakes be divided on $6$ (different) children, so that each child receive at least one book and one cake?



      I got: The number of ways to divide $6$ different books on $6$ different children is the same as finding all surjective functions from a set $X$, with $|X|=9$ to set $Y$, where $|6|$. The number is $6!×S(9,6)$.



      The number of ways to divide $17$ identical cakes on $6$ different children (here is where I am wrong) should in my mind be, after you give out one cake to each child, an unordered sequence with repetition: $binom11+6-16$. However this is wrong, the right answer here is $binom11+6-15$. Can someone please explain that last step to me?










      share|cite|improve this question











      $endgroup$




      I'm trying to learn how to count but I'm having some problem.



      The problem: In how many ways can $9$ different books and $17$ identical cakes be divided on $6$ (different) children, so that each child receive at least one book and one cake?



      I got: The number of ways to divide $6$ different books on $6$ different children is the same as finding all surjective functions from a set $X$, with $|X|=9$ to set $Y$, where $|6|$. The number is $6!×S(9,6)$.



      The number of ways to divide $17$ identical cakes on $6$ different children (here is where I am wrong) should in my mind be, after you give out one cake to each child, an unordered sequence with repetition: $binom11+6-16$. However this is wrong, the right answer here is $binom11+6-15$. Can someone please explain that last step to me?







      combinatorics discrete-mathematics






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Mar 12 at 15:09









      N. F. Taussig

      44.7k103358




      44.7k103358










      asked Mar 12 at 10:21









      BLCAANBLCAAN

      624




      624




















          1 Answer
          1






          active

          oldest

          votes


















          1












          $begingroup$

          In the stars-and-bars formulation of the second problem, there are $17$ stars (cakes), but only $5$ bars (children) to place in the $17-1=16$ spaces between adjacent stars, because those $5$ bars define $6$ partitions around them (before, between and after) which are identified with the $6$ children.



          Then the number of ways to assign cakes to children is the same as the number of ways to choose, among the $16$ spaces, $5$ spaces to hold the bars, hence $binom11+6-15$ and not $binom11+6-16$.






          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%2f3144912%2fin-how-many-ways-can-9-different-books-and-17-identical-cakes-be-divided-on-6-ch%23new-answer', 'question_page');

            );

            Post as a guest















            Required, but never shown

























            1 Answer
            1






            active

            oldest

            votes








            1 Answer
            1






            active

            oldest

            votes









            active

            oldest

            votes






            active

            oldest

            votes









            1












            $begingroup$

            In the stars-and-bars formulation of the second problem, there are $17$ stars (cakes), but only $5$ bars (children) to place in the $17-1=16$ spaces between adjacent stars, because those $5$ bars define $6$ partitions around them (before, between and after) which are identified with the $6$ children.



            Then the number of ways to assign cakes to children is the same as the number of ways to choose, among the $16$ spaces, $5$ spaces to hold the bars, hence $binom11+6-15$ and not $binom11+6-16$.






            share|cite|improve this answer









            $endgroup$

















              1












              $begingroup$

              In the stars-and-bars formulation of the second problem, there are $17$ stars (cakes), but only $5$ bars (children) to place in the $17-1=16$ spaces between adjacent stars, because those $5$ bars define $6$ partitions around them (before, between and after) which are identified with the $6$ children.



              Then the number of ways to assign cakes to children is the same as the number of ways to choose, among the $16$ spaces, $5$ spaces to hold the bars, hence $binom11+6-15$ and not $binom11+6-16$.






              share|cite|improve this answer









              $endgroup$















                1












                1








                1





                $begingroup$

                In the stars-and-bars formulation of the second problem, there are $17$ stars (cakes), but only $5$ bars (children) to place in the $17-1=16$ spaces between adjacent stars, because those $5$ bars define $6$ partitions around them (before, between and after) which are identified with the $6$ children.



                Then the number of ways to assign cakes to children is the same as the number of ways to choose, among the $16$ spaces, $5$ spaces to hold the bars, hence $binom11+6-15$ and not $binom11+6-16$.






                share|cite|improve this answer









                $endgroup$



                In the stars-and-bars formulation of the second problem, there are $17$ stars (cakes), but only $5$ bars (children) to place in the $17-1=16$ spaces between adjacent stars, because those $5$ bars define $6$ partitions around them (before, between and after) which are identified with the $6$ children.



                Then the number of ways to assign cakes to children is the same as the number of ways to choose, among the $16$ spaces, $5$ spaces to hold the bars, hence $binom11+6-15$ and not $binom11+6-16$.







                share|cite|improve this answer












                share|cite|improve this answer



                share|cite|improve this answer










                answered Mar 12 at 10:39









                Parcly TaxelParcly Taxel

                44.5k1376109




                44.5k1376109



























                    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%2f3144912%2fin-how-many-ways-can-9-different-books-and-17-identical-cakes-be-divided-on-6-ch%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

                    Solar Wings Breeze Design and development Specifications (Breeze) References Navigation menu1368-485X"Hang glider: Breeze (Solar Wings)"e

                    Kathakali Contents Etymology and nomenclature History Repertoire Songs and musical instruments Traditional plays Styles: Sampradayam Training centers and awards Relationship to other dance forms See also Notes References External links Navigation menueThe Illustrated Encyclopedia of Hinduism: A-MSouth Asian Folklore: An EncyclopediaRoutledge International Encyclopedia of Women: Global Women's Issues and KnowledgeKathakali Dance-drama: Where Gods and Demons Come to PlayKathakali Dance-drama: Where Gods and Demons Come to PlayKathakali Dance-drama: Where Gods and Demons Come to Play10.1353/atj.2005.0004The Illustrated Encyclopedia of Hinduism: A-MEncyclopedia of HinduismKathakali Dance-drama: Where Gods and Demons Come to PlaySonic Liturgy: Ritual and Music in Hindu Tradition"The Mirror of Gesture"Kathakali Dance-drama: Where Gods and Demons Come to Play"Kathakali"Indian Theatre: Traditions of PerformanceIndian Theatre: Traditions of PerformanceIndian Theatre: Traditions of PerformanceIndian Theatre: Traditions of PerformanceMedieval Indian Literature: An AnthologyThe Oxford Companion to Indian TheatreSouth Asian Folklore: An Encyclopedia : Afghanistan, Bangladesh, India, Nepal, Pakistan, Sri LankaThe Rise of Performance Studies: Rethinking Richard Schechner's Broad SpectrumIndian Theatre: Traditions of PerformanceModern Asian Theatre and Performance 1900-2000Critical Theory and PerformanceBetween Theater and AnthropologyKathakali603847011Indian Theatre: Traditions of PerformanceIndian Theatre: Traditions of PerformanceIndian Theatre: Traditions of PerformanceBetween Theater and AnthropologyBetween Theater and AnthropologyNambeesan Smaraka AwardsArchivedThe Cambridge Guide to TheatreRoutledge International Encyclopedia of Women: Global Women's Issues and KnowledgeThe Garland Encyclopedia of World Music: South Asia : the Indian subcontinentThe Ethos of Noh: Actors and Their Art10.2307/1145740By Means of Performance: Intercultural Studies of Theatre and Ritual10.1017/s204912550000100xReconceiving the Renaissance: A Critical ReaderPerformance TheoryListening to Theatre: The Aural Dimension of Beijing Opera10.2307/1146013Kathakali: The Art of the Non-WorldlyOn KathakaliKathakali, the dance theatreThe Kathakali Complex: Performance & StructureKathakali Dance-Drama: Where Gods and Demons Come to Play10.1093/obo/9780195399318-0071Drama and Ritual of Early Hinduism"In the Shadow of Hollywood Orientalism: Authentic East Indian Dancing"10.1080/08949460490274013Sanskrit Play Production in Ancient IndiaIndian Music: History and StructureBharata, the Nāṭyaśāstra233639306Table of Contents2238067286469807Dance In Indian Painting10.2307/32047833204783Kathakali Dance-Theatre: A Visual Narrative of Sacred Indian MimeIndian Classical Dance: The Renaissance and BeyondKathakali: an indigenous art-form of Keralaeee

                    Method to test if a number is a perfect power? Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern)Detecting perfect squares faster than by extracting square rooteffective way to get the integer sequence A181392 from oeisA rarely mentioned fact about perfect powersHow many numbers such $n$ are there that $n<100,lfloorsqrtn rfloor mid n$Check perfect squareness by modulo division against multiple basesFor what pair of integers $(a,b)$ is $3^a + 7^b$ a perfect square.Do there exist any positive integers $n$ such that $lfloore^nrfloor$ is a perfect power? What is the probability that one exists?finding perfect power factors of an integerProve that the sequence contains a perfect square for any natural number $m $ in the domain of $f$ .Counting Perfect Powers