Combinatorial Proof for the equation $sum_{i=0}^j {j choose i} 2^{j-i} = 3^j$












1












$begingroup$


$$sum_{i=0}^j {j choose i}2^{j-i} = 3^j$$



My approach: I know the binomial way to do this is to think of the RHS as $(1+2)^j$ and then expand using binomial like so:
$$(1+2)^j = sum_{i=0}^j {j choose i} cdot 2^{j-i} cdot 1^i$$
$$ = (1+2)^j = sum_{i=0}^j {j choose i} cdot 2^{j-i}$$



But I am not sure how to do the combinatorial proof.






combinatorics discrete-mathematics binomial-theorem







share|cite|improve this question











$endgroup$












  • $begingroup$
    What do you mean by 'the combinatorial proof'?
    $endgroup$
    – caverac
    Dec 21 '18 at 10:36










  • $begingroup$
    @caverac In a combinatorial proof, you count the same set of objects in two different ways to show that the expressions are equal. For instance, to prove the identity $kbinom{n}{k} = nbinom{n - 1}{k - 1}$, you would count committees of size $k$ with a chairperson that can be selected from a group with $n$ people. The left side counts the number of ways of selecting a group of $k$ people, then choosing a chairperson from among the group. The right side counts the number of ways of selecting a chairperson, then selecting the other $k - 1$ members of the committee from the remaining people.
    $endgroup$
    – N. F. Taussig
    Dec 21 '18 at 10:46










  • $begingroup$
    @N.F.Taussig Thanks for the explanation, I didn't realize the OP was looking for a proof different to the one he sketched, which is completely valid
    $endgroup$
    – caverac
    Dec 21 '18 at 12:20
















1












$begingroup$


$$sum_{i=0}^j {j choose i}2^{j-i} = 3^j$$



My approach: I know the binomial way to do this is to think of the RHS as $(1+2)^j$ and then expand using binomial like so:
$$(1+2)^j = sum_{i=0}^j {j choose i} cdot 2^{j-i} cdot 1^i$$
$$ = (1+2)^j = sum_{i=0}^j {j choose i} cdot 2^{j-i}$$



But I am not sure how to do the combinatorial proof.






combinatorics discrete-mathematics binomial-theorem







share|cite|improve this question











$endgroup$












  • $begingroup$
    What do you mean by 'the combinatorial proof'?
    $endgroup$
    – caverac
    Dec 21 '18 at 10:36










  • $begingroup$
    @caverac In a combinatorial proof, you count the same set of objects in two different ways to show that the expressions are equal. For instance, to prove the identity $kbinom{n}{k} = nbinom{n - 1}{k - 1}$, you would count committees of size $k$ with a chairperson that can be selected from a group with $n$ people. The left side counts the number of ways of selecting a group of $k$ people, then choosing a chairperson from among the group. The right side counts the number of ways of selecting a chairperson, then selecting the other $k - 1$ members of the committee from the remaining people.
    $endgroup$
    – N. F. Taussig
    Dec 21 '18 at 10:46










  • $begingroup$
    @N.F.Taussig Thanks for the explanation, I didn't realize the OP was looking for a proof different to the one he sketched, which is completely valid
    $endgroup$
    – caverac
    Dec 21 '18 at 12:20














1












1








1


1



$begingroup$


$$sum_{i=0}^j {j choose i}2^{j-i} = 3^j$$



My approach: I know the binomial way to do this is to think of the RHS as $(1+2)^j$ and then expand using binomial like so:
$$(1+2)^j = sum_{i=0}^j {j choose i} cdot 2^{j-i} cdot 1^i$$
$$ = (1+2)^j = sum_{i=0}^j {j choose i} cdot 2^{j-i}$$



But I am not sure how to do the combinatorial proof.






combinatorics discrete-mathematics binomial-theorem







share|cite|improve this question











$endgroup$




$$sum_{i=0}^j {j choose i}2^{j-i} = 3^j$$



My approach: I know the binomial way to do this is to think of the RHS as $(1+2)^j$ and then expand using binomial like so:
$$(1+2)^j = sum_{i=0}^j {j choose i} cdot 2^{j-i} cdot 1^i$$
$$ = (1+2)^j = sum_{i=0}^j {j choose i} cdot 2^{j-i}$$



But I am not sure how to do the combinatorial proof.






combinatorics discrete-mathematics binomial-theorem




combinatorics discrete-mathematics binomial-theorem






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 21 '18 at 12:23









N. F. Taussig

44.3k93357




44.3k93357










asked Dec 21 '18 at 10:33









hussain sagarhussain sagar

858




858












  • $begingroup$
    What do you mean by 'the combinatorial proof'?
    $endgroup$
    – caverac
    Dec 21 '18 at 10:36










  • $begingroup$
    @caverac In a combinatorial proof, you count the same set of objects in two different ways to show that the expressions are equal. For instance, to prove the identity $kbinom{n}{k} = nbinom{n - 1}{k - 1}$, you would count committees of size $k$ with a chairperson that can be selected from a group with $n$ people. The left side counts the number of ways of selecting a group of $k$ people, then choosing a chairperson from among the group. The right side counts the number of ways of selecting a chairperson, then selecting the other $k - 1$ members of the committee from the remaining people.
    $endgroup$
    – N. F. Taussig
    Dec 21 '18 at 10:46










  • $begingroup$
    @N.F.Taussig Thanks for the explanation, I didn't realize the OP was looking for a proof different to the one he sketched, which is completely valid
    $endgroup$
    – caverac
    Dec 21 '18 at 12:20


















  • $begingroup$
    What do you mean by 'the combinatorial proof'?
    $endgroup$
    – caverac
    Dec 21 '18 at 10:36










  • $begingroup$
    @caverac In a combinatorial proof, you count the same set of objects in two different ways to show that the expressions are equal. For instance, to prove the identity $kbinom{n}{k} = nbinom{n - 1}{k - 1}$, you would count committees of size $k$ with a chairperson that can be selected from a group with $n$ people. The left side counts the number of ways of selecting a group of $k$ people, then choosing a chairperson from among the group. The right side counts the number of ways of selecting a chairperson, then selecting the other $k - 1$ members of the committee from the remaining people.
    $endgroup$
    – N. F. Taussig
    Dec 21 '18 at 10:46










  • $begingroup$
    @N.F.Taussig Thanks for the explanation, I didn't realize the OP was looking for a proof different to the one he sketched, which is completely valid
    $endgroup$
    – caverac
    Dec 21 '18 at 12:20
















$begingroup$
What do you mean by 'the combinatorial proof'?
$endgroup$
– caverac
Dec 21 '18 at 10:36




$begingroup$
What do you mean by 'the combinatorial proof'?
$endgroup$
– caverac
Dec 21 '18 at 10:36












$begingroup$
@caverac In a combinatorial proof, you count the same set of objects in two different ways to show that the expressions are equal. For instance, to prove the identity $kbinom{n}{k} = nbinom{n - 1}{k - 1}$, you would count committees of size $k$ with a chairperson that can be selected from a group with $n$ people. The left side counts the number of ways of selecting a group of $k$ people, then choosing a chairperson from among the group. The right side counts the number of ways of selecting a chairperson, then selecting the other $k - 1$ members of the committee from the remaining people.
$endgroup$
– N. F. Taussig
Dec 21 '18 at 10:46




$begingroup$
@caverac In a combinatorial proof, you count the same set of objects in two different ways to show that the expressions are equal. For instance, to prove the identity $kbinom{n}{k} = nbinom{n - 1}{k - 1}$, you would count committees of size $k$ with a chairperson that can be selected from a group with $n$ people. The left side counts the number of ways of selecting a group of $k$ people, then choosing a chairperson from among the group. The right side counts the number of ways of selecting a chairperson, then selecting the other $k - 1$ members of the committee from the remaining people.
$endgroup$
– N. F. Taussig
Dec 21 '18 at 10:46












$begingroup$
@N.F.Taussig Thanks for the explanation, I didn't realize the OP was looking for a proof different to the one he sketched, which is completely valid
$endgroup$
– caverac
Dec 21 '18 at 12:20




$begingroup$
@N.F.Taussig Thanks for the explanation, I didn't realize the OP was looking for a proof different to the one he sketched, which is completely valid
$endgroup$
– caverac
Dec 21 '18 at 12:20










2 Answers
2






active

oldest

votes


















7












$begingroup$

A combinatorical proof could go as follows:




  • The number of digit sequences of length $j$ formed with $3$ digits ${1,2,3}$ is: $color{blue}{3^j}$.

  • Now, fix one digit. For example $1$. It can occur $color{blue}{i=0,..,j}$ times in a digit sequence.

  • The number of ways to place $i$ times the digit $1$ is: $color{blue}{binom{j}{i}}$

  • You can fill the remaining $j-i$ places with any of the two other digits: $color{blue}{2^{j-i}}$
    All together:
    $$boxed{color{blue}{sum_{i=0}^j binom{j}{i}2^{j-i} = 3^j}}$$






share|cite|improve this answer









$endgroup$













  • $begingroup$
    I like your use of colour! :)
    $endgroup$
    – Shaun
    Dec 21 '18 at 11:27



















3












$begingroup$

The problem - how many $j$-length vectors can be composed of the digits ${0,1,2}$?



RHS - straight forward.



LHS - first, pick the $i$-indexes in the vector where 0 appears - $j choose i$, then choose between ${1,2}$ for the $j-i$ remaining indexes - $2^{j-i}$ options of doing so. Summing over all $i$'s gives all the required vectors.






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%2f3048378%2fcombinatorial-proof-for-the-equation-sum-i-0j-j-choose-i-2j-i-3j%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









    7












    $begingroup$

    A combinatorical proof could go as follows:




    • The number of digit sequences of length $j$ formed with $3$ digits ${1,2,3}$ is: $color{blue}{3^j}$.

    • Now, fix one digit. For example $1$. It can occur $color{blue}{i=0,..,j}$ times in a digit sequence.

    • The number of ways to place $i$ times the digit $1$ is: $color{blue}{binom{j}{i}}$

    • You can fill the remaining $j-i$ places with any of the two other digits: $color{blue}{2^{j-i}}$
      All together:
      $$boxed{color{blue}{sum_{i=0}^j binom{j}{i}2^{j-i} = 3^j}}$$






    share|cite|improve this answer









    $endgroup$













    • $begingroup$
      I like your use of colour! :)
      $endgroup$
      – Shaun
      Dec 21 '18 at 11:27
















    7












    $begingroup$

    A combinatorical proof could go as follows:




    • The number of digit sequences of length $j$ formed with $3$ digits ${1,2,3}$ is: $color{blue}{3^j}$.

    • Now, fix one digit. For example $1$. It can occur $color{blue}{i=0,..,j}$ times in a digit sequence.

    • The number of ways to place $i$ times the digit $1$ is: $color{blue}{binom{j}{i}}$

    • You can fill the remaining $j-i$ places with any of the two other digits: $color{blue}{2^{j-i}}$
      All together:
      $$boxed{color{blue}{sum_{i=0}^j binom{j}{i}2^{j-i} = 3^j}}$$






    share|cite|improve this answer









    $endgroup$













    • $begingroup$
      I like your use of colour! :)
      $endgroup$
      – Shaun
      Dec 21 '18 at 11:27














    7












    7








    7





    $begingroup$

    A combinatorical proof could go as follows:




    • The number of digit sequences of length $j$ formed with $3$ digits ${1,2,3}$ is: $color{blue}{3^j}$.

    • Now, fix one digit. For example $1$. It can occur $color{blue}{i=0,..,j}$ times in a digit sequence.

    • The number of ways to place $i$ times the digit $1$ is: $color{blue}{binom{j}{i}}$

    • You can fill the remaining $j-i$ places with any of the two other digits: $color{blue}{2^{j-i}}$
      All together:
      $$boxed{color{blue}{sum_{i=0}^j binom{j}{i}2^{j-i} = 3^j}}$$






    share|cite|improve this answer









    $endgroup$



    A combinatorical proof could go as follows:




    • The number of digit sequences of length $j$ formed with $3$ digits ${1,2,3}$ is: $color{blue}{3^j}$.

    • Now, fix one digit. For example $1$. It can occur $color{blue}{i=0,..,j}$ times in a digit sequence.

    • The number of ways to place $i$ times the digit $1$ is: $color{blue}{binom{j}{i}}$

    • You can fill the remaining $j-i$ places with any of the two other digits: $color{blue}{2^{j-i}}$
      All together:
      $$boxed{color{blue}{sum_{i=0}^j binom{j}{i}2^{j-i} = 3^j}}$$







    share|cite|improve this answer












    share|cite|improve this answer



    share|cite|improve this answer










    answered Dec 21 '18 at 10:50









    trancelocationtrancelocation

    11.7k1724




    11.7k1724












    • $begingroup$
      I like your use of colour! :)
      $endgroup$
      – Shaun
      Dec 21 '18 at 11:27


















    • $begingroup$
      I like your use of colour! :)
      $endgroup$
      – Shaun
      Dec 21 '18 at 11:27
















    $begingroup$
    I like your use of colour! :)
    $endgroup$
    – Shaun
    Dec 21 '18 at 11:27




    $begingroup$
    I like your use of colour! :)
    $endgroup$
    – Shaun
    Dec 21 '18 at 11:27











    3












    $begingroup$

    The problem - how many $j$-length vectors can be composed of the digits ${0,1,2}$?



    RHS - straight forward.



    LHS - first, pick the $i$-indexes in the vector where 0 appears - $j choose i$, then choose between ${1,2}$ for the $j-i$ remaining indexes - $2^{j-i}$ options of doing so. Summing over all $i$'s gives all the required vectors.






    share|cite|improve this answer









    $endgroup$


















      3












      $begingroup$

      The problem - how many $j$-length vectors can be composed of the digits ${0,1,2}$?



      RHS - straight forward.



      LHS - first, pick the $i$-indexes in the vector where 0 appears - $j choose i$, then choose between ${1,2}$ for the $j-i$ remaining indexes - $2^{j-i}$ options of doing so. Summing over all $i$'s gives all the required vectors.






      share|cite|improve this answer









      $endgroup$
















        3












        3








        3





        $begingroup$

        The problem - how many $j$-length vectors can be composed of the digits ${0,1,2}$?



        RHS - straight forward.



        LHS - first, pick the $i$-indexes in the vector where 0 appears - $j choose i$, then choose between ${1,2}$ for the $j-i$ remaining indexes - $2^{j-i}$ options of doing so. Summing over all $i$'s gives all the required vectors.






        share|cite|improve this answer









        $endgroup$



        The problem - how many $j$-length vectors can be composed of the digits ${0,1,2}$?



        RHS - straight forward.



        LHS - first, pick the $i$-indexes in the vector where 0 appears - $j choose i$, then choose between ${1,2}$ for the $j-i$ remaining indexes - $2^{j-i}$ options of doing so. Summing over all $i$'s gives all the required vectors.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Dec 21 '18 at 10:49









        BelkanBelkan

        687




        687






























            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%2f3048378%2fcombinatorial-proof-for-the-equation-sum-i-0j-j-choose-i-2j-i-3j%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

            Image
            up vote 0 down vote favorite I have $99$ identical square tiles, each with a quarter-circle drawn on it like this: [asy] size(1.5cm); draw(Arc((2,0),1,90,180),red+1); draw((0,0)--(2,0)--(2,2)--(0,2)--(0,0)); [/asy] When I arrange the tiles in a $9times 11$ rectangular grid, each with a random orientation, what is the expected value of the number of full circles I form? I think this problem has to do with finding the chance any given 2x2 square has a circle, but I can't find it. expected-value share | cite | improve this question asked Nov 20 at 15:03 6minecraftninja 1 2
            Read more

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

            Image
            0 I think it's similiar to NFAs. I replace the finite states of the given automaton for start-states for my new automaton. I do it with $epsilon$ -transition from the start state to the actual finite states of the given automaton. The start state of the given automaton will be my accepting(finite) state of my new one. All transitions will be reversed of course to recognize the reversed word. But how do I have to change the stack of the pushdown automaton? That's tricky. formal-languages automata context-free-grammar share | cite | improve this question edited Nov 29 '18 at 14:20 joee
            Read more

            Mont Emei

            Image
            Mont Emei.mw-parser-output .entete.map{background-image:url("//upload.wikimedia.org/wikipedia/commons/7/7a/Picto_infobox_map.png")} Vue du sommet Wanfo du mont Emei Géographie Altitude 3 099  m , Wanfo Coordonnées 29° 31′ 11″ nord, 103° 19′ 57″ est Administration Pays   Chine Province Sichuan Ville-préfecture Leshan Géolocalisation sur la carte : Sichuan Mont Emei Géolocalisation sur la carte : Chine Mont Emei modifier   Paysage panoramique du mont Emei, incluant le paysage panoramique du grand Bouddha de Leshan *   Patrimoine mondial de l'UNESCO Passerelle en bois sur le versant ouest Pays   Chine Subdivision Sichuan Type Mixte Critères (iv) (vi) (x) Superficie 15 400 ha Numéro d’identification 779 Zone géographique Asie et Pacifique  ** Année d’inscription 1996 (20 e session) * Descriptif officiel UNESCO ** Classification géog
            Read more