How many solutions are there to the equation $x + y + z + w = 17$?












2












$begingroup$



How many solutions are there to the equation $x + y + z + w = 17$ for non-negative integers $w, x, y, z$ ?




I don't know if I'm doing this right, but I guessed that the solution would be $binom{20}{3}$, which equals $1140$. Am I doing this right?










share|cite|improve this question











$endgroup$












  • $begingroup$
    Are $x, y, z, w$ meant to take positive integer values? Non-negative integer values? Something else?
    $endgroup$
    – Srivatsan
    Dec 15 '11 at 12:33










  • $begingroup$
    They are non-negative integers
    $endgroup$
    – user754950
    Dec 15 '11 at 12:38






  • 1




    $begingroup$
    See math.stackexchange.com/questions/86820/… and the questions referenced there.
    $endgroup$
    – Gerry Myerson
    Dec 15 '11 at 12:38
















2












$begingroup$



How many solutions are there to the equation $x + y + z + w = 17$ for non-negative integers $w, x, y, z$ ?




I don't know if I'm doing this right, but I guessed that the solution would be $binom{20}{3}$, which equals $1140$. Am I doing this right?










share|cite|improve this question











$endgroup$












  • $begingroup$
    Are $x, y, z, w$ meant to take positive integer values? Non-negative integer values? Something else?
    $endgroup$
    – Srivatsan
    Dec 15 '11 at 12:33










  • $begingroup$
    They are non-negative integers
    $endgroup$
    – user754950
    Dec 15 '11 at 12:38






  • 1




    $begingroup$
    See math.stackexchange.com/questions/86820/… and the questions referenced there.
    $endgroup$
    – Gerry Myerson
    Dec 15 '11 at 12:38














2












2








2


3



$begingroup$



How many solutions are there to the equation $x + y + z + w = 17$ for non-negative integers $w, x, y, z$ ?




I don't know if I'm doing this right, but I guessed that the solution would be $binom{20}{3}$, which equals $1140$. Am I doing this right?










share|cite|improve this question











$endgroup$





How many solutions are there to the equation $x + y + z + w = 17$ for non-negative integers $w, x, y, z$ ?




I don't know if I'm doing this right, but I guessed that the solution would be $binom{20}{3}$, which equals $1140$. Am I doing this right?







combinatorics discrete-mathematics binomial-coefficients diophantine-equations






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Feb 7 '16 at 10:29







user228113

















asked Dec 15 '11 at 12:30









user754950user754950

175247




175247












  • $begingroup$
    Are $x, y, z, w$ meant to take positive integer values? Non-negative integer values? Something else?
    $endgroup$
    – Srivatsan
    Dec 15 '11 at 12:33










  • $begingroup$
    They are non-negative integers
    $endgroup$
    – user754950
    Dec 15 '11 at 12:38






  • 1




    $begingroup$
    See math.stackexchange.com/questions/86820/… and the questions referenced there.
    $endgroup$
    – Gerry Myerson
    Dec 15 '11 at 12:38


















  • $begingroup$
    Are $x, y, z, w$ meant to take positive integer values? Non-negative integer values? Something else?
    $endgroup$
    – Srivatsan
    Dec 15 '11 at 12:33










  • $begingroup$
    They are non-negative integers
    $endgroup$
    – user754950
    Dec 15 '11 at 12:38






  • 1




    $begingroup$
    See math.stackexchange.com/questions/86820/… and the questions referenced there.
    $endgroup$
    – Gerry Myerson
    Dec 15 '11 at 12:38
















$begingroup$
Are $x, y, z, w$ meant to take positive integer values? Non-negative integer values? Something else?
$endgroup$
– Srivatsan
Dec 15 '11 at 12:33




$begingroup$
Are $x, y, z, w$ meant to take positive integer values? Non-negative integer values? Something else?
$endgroup$
– Srivatsan
Dec 15 '11 at 12:33












$begingroup$
They are non-negative integers
$endgroup$
– user754950
Dec 15 '11 at 12:38




$begingroup$
They are non-negative integers
$endgroup$
– user754950
Dec 15 '11 at 12:38




1




1




$begingroup$
See math.stackexchange.com/questions/86820/… and the questions referenced there.
$endgroup$
– Gerry Myerson
Dec 15 '11 at 12:38




$begingroup$
See math.stackexchange.com/questions/86820/… and the questions referenced there.
$endgroup$
– Gerry Myerson
Dec 15 '11 at 12:38










2 Answers
2






active

oldest

votes


















4












$begingroup$

Your result is correct. You are looking for the number of monomials of total degree $17$ in $4$ variables. There are
$$binom{17+4-1}{17}=binom{20}{17}=frac{20cdot 19cdot 18}{3cdot 2} = 20cdot19cdot3 = 1140$$
of these.



A proof would be the following. We associate to any solution $(x,y,z,w)$ a weakly increasing sequence of length $17$, where $0$ appears $x$ times, $1$ appears $y$ times, and so on. For instance, the solution $(4,3,2,8)$ would correspond to
$$(0,0,0,0,1,1,1,2,2,3,3,3,3,3,3,3,3)$$
By adding $i$ to the $i$-th component of that sequence, it becomes strictly increasing. This way, we can see that the solutions correspond to subsets of ${1,ldots,17+4-1}$ of cardinality $17$. Of course, you can replace $17$ and $4$ by $n$ and $d$ to obtain a more general statement.






share|cite|improve this answer











$endgroup$





















    13












    $begingroup$

    Line up $20$ skittles in a row:



    + + + + + + + + + + + + + + + + + + + +


    Knock any three of them over:



    + + + x + + + + + + x x + + + + + + + +


    Now let $x,y,z,$ and $w$ be the number of skittles left standing between the knocked-over skittles. In this case $x=3, y=6, z=0,$ and $w=8$.



    So your answer is correct.






    share|cite|improve this answer









    $endgroup$













    • $begingroup$
      that's beautiful.
      $endgroup$
      – Jesko Hüttenhain
      Dec 15 '11 at 13:22






    • 1




      $begingroup$
      I was a bridge programmer a long time ago. In bridge, C + D + H + S = 13.
      $endgroup$
      – TonyK
      Dec 15 '11 at 13:36











    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%2f91733%2fhow-many-solutions-are-there-to-the-equation-x-y-z-w-17%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









    4












    $begingroup$

    Your result is correct. You are looking for the number of monomials of total degree $17$ in $4$ variables. There are
    $$binom{17+4-1}{17}=binom{20}{17}=frac{20cdot 19cdot 18}{3cdot 2} = 20cdot19cdot3 = 1140$$
    of these.



    A proof would be the following. We associate to any solution $(x,y,z,w)$ a weakly increasing sequence of length $17$, where $0$ appears $x$ times, $1$ appears $y$ times, and so on. For instance, the solution $(4,3,2,8)$ would correspond to
    $$(0,0,0,0,1,1,1,2,2,3,3,3,3,3,3,3,3)$$
    By adding $i$ to the $i$-th component of that sequence, it becomes strictly increasing. This way, we can see that the solutions correspond to subsets of ${1,ldots,17+4-1}$ of cardinality $17$. Of course, you can replace $17$ and $4$ by $n$ and $d$ to obtain a more general statement.






    share|cite|improve this answer











    $endgroup$


















      4












      $begingroup$

      Your result is correct. You are looking for the number of monomials of total degree $17$ in $4$ variables. There are
      $$binom{17+4-1}{17}=binom{20}{17}=frac{20cdot 19cdot 18}{3cdot 2} = 20cdot19cdot3 = 1140$$
      of these.



      A proof would be the following. We associate to any solution $(x,y,z,w)$ a weakly increasing sequence of length $17$, where $0$ appears $x$ times, $1$ appears $y$ times, and so on. For instance, the solution $(4,3,2,8)$ would correspond to
      $$(0,0,0,0,1,1,1,2,2,3,3,3,3,3,3,3,3)$$
      By adding $i$ to the $i$-th component of that sequence, it becomes strictly increasing. This way, we can see that the solutions correspond to subsets of ${1,ldots,17+4-1}$ of cardinality $17$. Of course, you can replace $17$ and $4$ by $n$ and $d$ to obtain a more general statement.






      share|cite|improve this answer











      $endgroup$
















        4












        4








        4





        $begingroup$

        Your result is correct. You are looking for the number of monomials of total degree $17$ in $4$ variables. There are
        $$binom{17+4-1}{17}=binom{20}{17}=frac{20cdot 19cdot 18}{3cdot 2} = 20cdot19cdot3 = 1140$$
        of these.



        A proof would be the following. We associate to any solution $(x,y,z,w)$ a weakly increasing sequence of length $17$, where $0$ appears $x$ times, $1$ appears $y$ times, and so on. For instance, the solution $(4,3,2,8)$ would correspond to
        $$(0,0,0,0,1,1,1,2,2,3,3,3,3,3,3,3,3)$$
        By adding $i$ to the $i$-th component of that sequence, it becomes strictly increasing. This way, we can see that the solutions correspond to subsets of ${1,ldots,17+4-1}$ of cardinality $17$. Of course, you can replace $17$ and $4$ by $n$ and $d$ to obtain a more general statement.






        share|cite|improve this answer











        $endgroup$



        Your result is correct. You are looking for the number of monomials of total degree $17$ in $4$ variables. There are
        $$binom{17+4-1}{17}=binom{20}{17}=frac{20cdot 19cdot 18}{3cdot 2} = 20cdot19cdot3 = 1140$$
        of these.



        A proof would be the following. We associate to any solution $(x,y,z,w)$ a weakly increasing sequence of length $17$, where $0$ appears $x$ times, $1$ appears $y$ times, and so on. For instance, the solution $(4,3,2,8)$ would correspond to
        $$(0,0,0,0,1,1,1,2,2,3,3,3,3,3,3,3,3)$$
        By adding $i$ to the $i$-th component of that sequence, it becomes strictly increasing. This way, we can see that the solutions correspond to subsets of ${1,ldots,17+4-1}$ of cardinality $17$. Of course, you can replace $17$ and $4$ by $n$ and $d$ to obtain a more general statement.







        share|cite|improve this answer














        share|cite|improve this answer



        share|cite|improve this answer








        edited Dec 15 '11 at 13:08

























        answered Dec 15 '11 at 12:47









        Jesko HüttenhainJesko Hüttenhain

        10.6k12357




        10.6k12357























            13












            $begingroup$

            Line up $20$ skittles in a row:



            + + + + + + + + + + + + + + + + + + + +


            Knock any three of them over:



            + + + x + + + + + + x x + + + + + + + +


            Now let $x,y,z,$ and $w$ be the number of skittles left standing between the knocked-over skittles. In this case $x=3, y=6, z=0,$ and $w=8$.



            So your answer is correct.






            share|cite|improve this answer









            $endgroup$













            • $begingroup$
              that's beautiful.
              $endgroup$
              – Jesko Hüttenhain
              Dec 15 '11 at 13:22






            • 1




              $begingroup$
              I was a bridge programmer a long time ago. In bridge, C + D + H + S = 13.
              $endgroup$
              – TonyK
              Dec 15 '11 at 13:36
















            13












            $begingroup$

            Line up $20$ skittles in a row:



            + + + + + + + + + + + + + + + + + + + +


            Knock any three of them over:



            + + + x + + + + + + x x + + + + + + + +


            Now let $x,y,z,$ and $w$ be the number of skittles left standing between the knocked-over skittles. In this case $x=3, y=6, z=0,$ and $w=8$.



            So your answer is correct.






            share|cite|improve this answer









            $endgroup$













            • $begingroup$
              that's beautiful.
              $endgroup$
              – Jesko Hüttenhain
              Dec 15 '11 at 13:22






            • 1




              $begingroup$
              I was a bridge programmer a long time ago. In bridge, C + D + H + S = 13.
              $endgroup$
              – TonyK
              Dec 15 '11 at 13:36














            13












            13








            13





            $begingroup$

            Line up $20$ skittles in a row:



            + + + + + + + + + + + + + + + + + + + +


            Knock any three of them over:



            + + + x + + + + + + x x + + + + + + + +


            Now let $x,y,z,$ and $w$ be the number of skittles left standing between the knocked-over skittles. In this case $x=3, y=6, z=0,$ and $w=8$.



            So your answer is correct.






            share|cite|improve this answer









            $endgroup$



            Line up $20$ skittles in a row:



            + + + + + + + + + + + + + + + + + + + +


            Knock any three of them over:



            + + + x + + + + + + x x + + + + + + + +


            Now let $x,y,z,$ and $w$ be the number of skittles left standing between the knocked-over skittles. In this case $x=3, y=6, z=0,$ and $w=8$.



            So your answer is correct.







            share|cite|improve this answer












            share|cite|improve this answer



            share|cite|improve this answer










            answered Dec 15 '11 at 13:19









            TonyKTonyK

            43k356135




            43k356135












            • $begingroup$
              that's beautiful.
              $endgroup$
              – Jesko Hüttenhain
              Dec 15 '11 at 13:22






            • 1




              $begingroup$
              I was a bridge programmer a long time ago. In bridge, C + D + H + S = 13.
              $endgroup$
              – TonyK
              Dec 15 '11 at 13:36


















            • $begingroup$
              that's beautiful.
              $endgroup$
              – Jesko Hüttenhain
              Dec 15 '11 at 13:22






            • 1




              $begingroup$
              I was a bridge programmer a long time ago. In bridge, C + D + H + S = 13.
              $endgroup$
              – TonyK
              Dec 15 '11 at 13:36
















            $begingroup$
            that's beautiful.
            $endgroup$
            – Jesko Hüttenhain
            Dec 15 '11 at 13:22




            $begingroup$
            that's beautiful.
            $endgroup$
            – Jesko Hüttenhain
            Dec 15 '11 at 13:22




            1




            1




            $begingroup$
            I was a bridge programmer a long time ago. In bridge, C + D + H + S = 13.
            $endgroup$
            – TonyK
            Dec 15 '11 at 13:36




            $begingroup$
            I was a bridge programmer a long time ago. In bridge, C + D + H + S = 13.
            $endgroup$
            – TonyK
            Dec 15 '11 at 13:36


















            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%2f91733%2fhow-many-solutions-are-there-to-the-equation-x-y-z-w-17%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

            Can a sorcerer learn a 5th-level spell early by creating spell slots using the Font of Magic feature?

            Does disintegrating a polymorphed enemy still kill it after the 2018 errata?

            A Topological Invariant for $pi_3(U(n))$