How many ways to pick 11 coins from those five piles of coins which must consists of all five different value...











up vote
0
down vote

favorite












If we have a piles of 10 pennies , a pile of 10 nickels, a pile of 10 dimes , a pile of 9 quarters and a pile of 8 half-dollar coins.



How many ways to pick 11 coins from those five piles of coins which must consists of all five different value of coins?



I figured out how to pick 11 coins from five piles of coins:



(5-1 +11)
C
(11) = 15 C 11 = 1365










share|cite|improve this question
























  • Welcome to MSE. Usually people don’t answer to questions that show no effort on the questioner’s part because it makes the questioner appear to use this site as a homework help site, which it is not. Please edit your question to show more effort, such as any attempts.
    – Kyky
    Nov 18 at 13:55










  • Chances are that you've already seen problems equivalent to this one and have been given a method to solve them. But the wording of those other problems may have been quite different. So it's a matter of trying to find the equivalence to a problem whose solution you already know.
    – David K
    Nov 18 at 14:58










  • I have done the first part and edit it.
    – Mark
    Nov 19 at 4:22










  • What is $15$ in $15 C11$? $11$ are the coin that you choose, but what is $15$?
    – Jimmy R.
    Nov 19 at 4:25










  • @user525966 That approach is wrong because $binom{42}{6}$ represents the situation when all the coins are unique.
    – Vaibhav
    Nov 19 at 7:30















up vote
0
down vote

favorite












If we have a piles of 10 pennies , a pile of 10 nickels, a pile of 10 dimes , a pile of 9 quarters and a pile of 8 half-dollar coins.



How many ways to pick 11 coins from those five piles of coins which must consists of all five different value of coins?



I figured out how to pick 11 coins from five piles of coins:



(5-1 +11)
C
(11) = 15 C 11 = 1365










share|cite|improve this question
























  • Welcome to MSE. Usually people don’t answer to questions that show no effort on the questioner’s part because it makes the questioner appear to use this site as a homework help site, which it is not. Please edit your question to show more effort, such as any attempts.
    – Kyky
    Nov 18 at 13:55










  • Chances are that you've already seen problems equivalent to this one and have been given a method to solve them. But the wording of those other problems may have been quite different. So it's a matter of trying to find the equivalence to a problem whose solution you already know.
    – David K
    Nov 18 at 14:58










  • I have done the first part and edit it.
    – Mark
    Nov 19 at 4:22










  • What is $15$ in $15 C11$? $11$ are the coin that you choose, but what is $15$?
    – Jimmy R.
    Nov 19 at 4:25










  • @user525966 That approach is wrong because $binom{42}{6}$ represents the situation when all the coins are unique.
    – Vaibhav
    Nov 19 at 7:30













up vote
0
down vote

favorite









up vote
0
down vote

favorite











If we have a piles of 10 pennies , a pile of 10 nickels, a pile of 10 dimes , a pile of 9 quarters and a pile of 8 half-dollar coins.



How many ways to pick 11 coins from those five piles of coins which must consists of all five different value of coins?



I figured out how to pick 11 coins from five piles of coins:



(5-1 +11)
C
(11) = 15 C 11 = 1365










share|cite|improve this question















If we have a piles of 10 pennies , a pile of 10 nickels, a pile of 10 dimes , a pile of 9 quarters and a pile of 8 half-dollar coins.



How many ways to pick 11 coins from those five piles of coins which must consists of all five different value of coins?



I figured out how to pick 11 coins from five piles of coins:



(5-1 +11)
C
(11) = 15 C 11 = 1365







combinatorics discrete-mathematics combinations






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Nov 19 at 7:06

























asked Nov 18 at 13:46









Mark

11




11












  • Welcome to MSE. Usually people don’t answer to questions that show no effort on the questioner’s part because it makes the questioner appear to use this site as a homework help site, which it is not. Please edit your question to show more effort, such as any attempts.
    – Kyky
    Nov 18 at 13:55










  • Chances are that you've already seen problems equivalent to this one and have been given a method to solve them. But the wording of those other problems may have been quite different. So it's a matter of trying to find the equivalence to a problem whose solution you already know.
    – David K
    Nov 18 at 14:58










  • I have done the first part and edit it.
    – Mark
    Nov 19 at 4:22










  • What is $15$ in $15 C11$? $11$ are the coin that you choose, but what is $15$?
    – Jimmy R.
    Nov 19 at 4:25










  • @user525966 That approach is wrong because $binom{42}{6}$ represents the situation when all the coins are unique.
    – Vaibhav
    Nov 19 at 7:30


















  • Welcome to MSE. Usually people don’t answer to questions that show no effort on the questioner’s part because it makes the questioner appear to use this site as a homework help site, which it is not. Please edit your question to show more effort, such as any attempts.
    – Kyky
    Nov 18 at 13:55










  • Chances are that you've already seen problems equivalent to this one and have been given a method to solve them. But the wording of those other problems may have been quite different. So it's a matter of trying to find the equivalence to a problem whose solution you already know.
    – David K
    Nov 18 at 14:58










  • I have done the first part and edit it.
    – Mark
    Nov 19 at 4:22










  • What is $15$ in $15 C11$? $11$ are the coin that you choose, but what is $15$?
    – Jimmy R.
    Nov 19 at 4:25










  • @user525966 That approach is wrong because $binom{42}{6}$ represents the situation when all the coins are unique.
    – Vaibhav
    Nov 19 at 7:30
















Welcome to MSE. Usually people don’t answer to questions that show no effort on the questioner’s part because it makes the questioner appear to use this site as a homework help site, which it is not. Please edit your question to show more effort, such as any attempts.
– Kyky
Nov 18 at 13:55




Welcome to MSE. Usually people don’t answer to questions that show no effort on the questioner’s part because it makes the questioner appear to use this site as a homework help site, which it is not. Please edit your question to show more effort, such as any attempts.
– Kyky
Nov 18 at 13:55












Chances are that you've already seen problems equivalent to this one and have been given a method to solve them. But the wording of those other problems may have been quite different. So it's a matter of trying to find the equivalence to a problem whose solution you already know.
– David K
Nov 18 at 14:58




Chances are that you've already seen problems equivalent to this one and have been given a method to solve them. But the wording of those other problems may have been quite different. So it's a matter of trying to find the equivalence to a problem whose solution you already know.
– David K
Nov 18 at 14:58












I have done the first part and edit it.
– Mark
Nov 19 at 4:22




I have done the first part and edit it.
– Mark
Nov 19 at 4:22












What is $15$ in $15 C11$? $11$ are the coin that you choose, but what is $15$?
– Jimmy R.
Nov 19 at 4:25




What is $15$ in $15 C11$? $11$ are the coin that you choose, but what is $15$?
– Jimmy R.
Nov 19 at 4:25












@user525966 That approach is wrong because $binom{42}{6}$ represents the situation when all the coins are unique.
– Vaibhav
Nov 19 at 7:30




@user525966 That approach is wrong because $binom{42}{6}$ represents the situation when all the coins are unique.
– Vaibhav
Nov 19 at 7:30










1 Answer
1






active

oldest

votes

















up vote
1
down vote













We can approach this in the following manner:



Let $a$ be the number of pennies chosen,
$b$ be the number of nickels chosen,
$c$ be the number of dimes chosen,
$d$ be the number of quarters chosen,
$e$ be the number of half-dollar coins chosen.



According to the given condition,



$a+b+c+d+e=11$



But $a,b,c,d,egeq 1$



So, substituting $p=a-1$, $q=b-1$, $r=c-1$, $s=d-1$, $t=e-1$,



We get ,
$p+q+r+s+t=6$ where $p,q,r,s,tgeq0$



The number of natural solutions will be ${(6+4) choose 4}$ i.e. $binom{10}{4} = 210$



We don't even have to worry about whether $a,b,c,d,e$ will exceed their limit of $10,10,10,9,8$ because we have chosen at least one from each pile which gives $max{a,b,c,d,e}$ possible $=7$.






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',
    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%2f3003548%2fhow-many-ways-to-pick-11-coins-from-those-five-piles-of-coins-which-must-consist%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








    up vote
    1
    down vote













    We can approach this in the following manner:



    Let $a$ be the number of pennies chosen,
    $b$ be the number of nickels chosen,
    $c$ be the number of dimes chosen,
    $d$ be the number of quarters chosen,
    $e$ be the number of half-dollar coins chosen.



    According to the given condition,



    $a+b+c+d+e=11$



    But $a,b,c,d,egeq 1$



    So, substituting $p=a-1$, $q=b-1$, $r=c-1$, $s=d-1$, $t=e-1$,



    We get ,
    $p+q+r+s+t=6$ where $p,q,r,s,tgeq0$



    The number of natural solutions will be ${(6+4) choose 4}$ i.e. $binom{10}{4} = 210$



    We don't even have to worry about whether $a,b,c,d,e$ will exceed their limit of $10,10,10,9,8$ because we have chosen at least one from each pile which gives $max{a,b,c,d,e}$ possible $=7$.






    share|cite|improve this answer

























      up vote
      1
      down vote













      We can approach this in the following manner:



      Let $a$ be the number of pennies chosen,
      $b$ be the number of nickels chosen,
      $c$ be the number of dimes chosen,
      $d$ be the number of quarters chosen,
      $e$ be the number of half-dollar coins chosen.



      According to the given condition,



      $a+b+c+d+e=11$



      But $a,b,c,d,egeq 1$



      So, substituting $p=a-1$, $q=b-1$, $r=c-1$, $s=d-1$, $t=e-1$,



      We get ,
      $p+q+r+s+t=6$ where $p,q,r,s,tgeq0$



      The number of natural solutions will be ${(6+4) choose 4}$ i.e. $binom{10}{4} = 210$



      We don't even have to worry about whether $a,b,c,d,e$ will exceed their limit of $10,10,10,9,8$ because we have chosen at least one from each pile which gives $max{a,b,c,d,e}$ possible $=7$.






      share|cite|improve this answer























        up vote
        1
        down vote










        up vote
        1
        down vote









        We can approach this in the following manner:



        Let $a$ be the number of pennies chosen,
        $b$ be the number of nickels chosen,
        $c$ be the number of dimes chosen,
        $d$ be the number of quarters chosen,
        $e$ be the number of half-dollar coins chosen.



        According to the given condition,



        $a+b+c+d+e=11$



        But $a,b,c,d,egeq 1$



        So, substituting $p=a-1$, $q=b-1$, $r=c-1$, $s=d-1$, $t=e-1$,



        We get ,
        $p+q+r+s+t=6$ where $p,q,r,s,tgeq0$



        The number of natural solutions will be ${(6+4) choose 4}$ i.e. $binom{10}{4} = 210$



        We don't even have to worry about whether $a,b,c,d,e$ will exceed their limit of $10,10,10,9,8$ because we have chosen at least one from each pile which gives $max{a,b,c,d,e}$ possible $=7$.






        share|cite|improve this answer












        We can approach this in the following manner:



        Let $a$ be the number of pennies chosen,
        $b$ be the number of nickels chosen,
        $c$ be the number of dimes chosen,
        $d$ be the number of quarters chosen,
        $e$ be the number of half-dollar coins chosen.



        According to the given condition,



        $a+b+c+d+e=11$



        But $a,b,c,d,egeq 1$



        So, substituting $p=a-1$, $q=b-1$, $r=c-1$, $s=d-1$, $t=e-1$,



        We get ,
        $p+q+r+s+t=6$ where $p,q,r,s,tgeq0$



        The number of natural solutions will be ${(6+4) choose 4}$ i.e. $binom{10}{4} = 210$



        We don't even have to worry about whether $a,b,c,d,e$ will exceed their limit of $10,10,10,9,8$ because we have chosen at least one from each pile which gives $max{a,b,c,d,e}$ possible $=7$.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Nov 19 at 7:28









        Vaibhav

        608




        608






























             

            draft saved


            draft discarded



















































             


            draft saved


            draft discarded














            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3003548%2fhow-many-ways-to-pick-11-coins-from-those-five-piles-of-coins-which-must-consist%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

            Quarter-circle Tiles

            build a pushdown automaton that recognizes the reverse language of a given pushdown automaton?

            Mont Emei