Prove that $sum_{j=0}^{n}sum_{i=j}^{n} {^nC_i} {^iC_j}=3^n$












1














Prove that



$$sum_{j=0}^{n}sum_{i=j}^{n} {^nC_i} ,{^iC_j}=3^n$$



I have tried by interchanging j by i but unable to prove. Don't know which combination formula would be used. Please help.






combinatorics discrete-mathematics combinations







share|cite|improve this question


















  • 1




    Hint: $dbinom{n}{i}dbinom{i}{j} = dbinom{n}{j} dbinom{n-j}{i-j}$.
    – darij grinberg
    Jan 4 at 15:53
















1














Prove that



$$sum_{j=0}^{n}sum_{i=j}^{n} {^nC_i} ,{^iC_j}=3^n$$



I have tried by interchanging j by i but unable to prove. Don't know which combination formula would be used. Please help.






combinatorics discrete-mathematics combinations







share|cite|improve this question


















  • 1




    Hint: $dbinom{n}{i}dbinom{i}{j} = dbinom{n}{j} dbinom{n-j}{i-j}$.
    – darij grinberg
    Jan 4 at 15:53














1












1








1


3





Prove that



$$sum_{j=0}^{n}sum_{i=j}^{n} {^nC_i} ,{^iC_j}=3^n$$



I have tried by interchanging j by i but unable to prove. Don't know which combination formula would be used. Please help.






combinatorics discrete-mathematics combinations







share|cite|improve this question













Prove that



$$sum_{j=0}^{n}sum_{i=j}^{n} {^nC_i} ,{^iC_j}=3^n$$



I have tried by interchanging j by i but unable to prove. Don't know which combination formula would be used. Please help.






combinatorics discrete-mathematics combinations




combinatorics discrete-mathematics combinations






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Jan 4 at 15:47









user1942348user1942348

1,3731732




1,3731732








  • 1




    Hint: $dbinom{n}{i}dbinom{i}{j} = dbinom{n}{j} dbinom{n-j}{i-j}$.
    – darij grinberg
    Jan 4 at 15:53














  • 1




    Hint: $dbinom{n}{i}dbinom{i}{j} = dbinom{n}{j} dbinom{n-j}{i-j}$.
    – darij grinberg
    Jan 4 at 15:53








1




1




Hint: $dbinom{n}{i}dbinom{i}{j} = dbinom{n}{j} dbinom{n-j}{i-j}$.
– darij grinberg
Jan 4 at 15:53




Hint: $dbinom{n}{i}dbinom{i}{j} = dbinom{n}{j} dbinom{n-j}{i-j}$.
– darij grinberg
Jan 4 at 15:53










2 Answers
2






active

oldest

votes


















2














Hints:




  • $displaystyle sum_{j=0}^nsum_{i=j}^n=sum_{i=0}^nsum_{j=0}^i$

  • $3=1+2$

  • $2=1+1$






share|cite|improve this answer





















  • Would you please write a bit more. How 3=1+2 and 2=1+1 helps?
    – user1942348
    Jan 4 at 16:53












  • @user1942348 After switching the order of summation, you can factor ${}^nC_i$ out of the inner summation. The remaining inner summation can be simplified with the binomial theorem.
    – Mike Earnest
    Jan 4 at 18:57










  • @user1942348 $3^n=(1+2)^n$. Now use the binomial theorem.
    – Arthur
    Jan 4 at 18:59



















1














First, let $S_{ij}$ be the set of words $s$ in ${0,1,2}^n$ that satisfy both of the following 1. and 2. below:




  1. Precisely $n-i$ of the letters of $s$ are "0", oe equivalently, precisely $i$ letters of $s$ are in ${1,2}$.

  2. Of the $i$ letters that are in ${1,2}$, there are precsiely $j$ of those letters that are "2".


(So $n-i$ letters of each $s in S_{ij}$ are "0", $i-j$ letters of $s$ are "1", and the remaining $j$ letters of $s$ are "2".)



On the one hand: $|S_{ij}|= {^nC_i} ,{^iC_j}$; first choose the $(n-i)$ out of $n$ positions of $s$ such that the letter in each such position is "0", and then from the remaining $i$ positions, choose the $j$ positions such that the letter in each such position is a "2". On the other hand, the $S_{ij}$s partition ${0,1,2}^n$, which has cardinality $3^n$. So this gives



$$3^n = sum_{i=1}^n sum_{j=1}^i |S_{ij}| = sum_{j=1}^n sum_{i=j}^n |S_{ij}| = sum_{j=1}^nsum_{i=j}^n {^nC_i} ,{^iC_j}.$$






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',
    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%2f3061776%2fprove-that-sum-j-0n-sum-i-jn-nc-i-ic-j-3n%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









    2














    Hints:




    • $displaystyle sum_{j=0}^nsum_{i=j}^n=sum_{i=0}^nsum_{j=0}^i$

    • $3=1+2$

    • $2=1+1$






    share|cite|improve this answer





















    • Would you please write a bit more. How 3=1+2 and 2=1+1 helps?
      – user1942348
      Jan 4 at 16:53












    • @user1942348 After switching the order of summation, you can factor ${}^nC_i$ out of the inner summation. The remaining inner summation can be simplified with the binomial theorem.
      – Mike Earnest
      Jan 4 at 18:57










    • @user1942348 $3^n=(1+2)^n$. Now use the binomial theorem.
      – Arthur
      Jan 4 at 18:59
















    2














    Hints:




    • $displaystyle sum_{j=0}^nsum_{i=j}^n=sum_{i=0}^nsum_{j=0}^i$

    • $3=1+2$

    • $2=1+1$






    share|cite|improve this answer





















    • Would you please write a bit more. How 3=1+2 and 2=1+1 helps?
      – user1942348
      Jan 4 at 16:53












    • @user1942348 After switching the order of summation, you can factor ${}^nC_i$ out of the inner summation. The remaining inner summation can be simplified with the binomial theorem.
      – Mike Earnest
      Jan 4 at 18:57










    • @user1942348 $3^n=(1+2)^n$. Now use the binomial theorem.
      – Arthur
      Jan 4 at 18:59














    2












    2








    2






    Hints:




    • $displaystyle sum_{j=0}^nsum_{i=j}^n=sum_{i=0}^nsum_{j=0}^i$

    • $3=1+2$

    • $2=1+1$






    share|cite|improve this answer












    Hints:




    • $displaystyle sum_{j=0}^nsum_{i=j}^n=sum_{i=0}^nsum_{j=0}^i$

    • $3=1+2$

    • $2=1+1$







    share|cite|improve this answer












    share|cite|improve this answer



    share|cite|improve this answer










    answered Jan 4 at 15:58









    ArthurArthur

    111k7106188




    111k7106188












    • Would you please write a bit more. How 3=1+2 and 2=1+1 helps?
      – user1942348
      Jan 4 at 16:53












    • @user1942348 After switching the order of summation, you can factor ${}^nC_i$ out of the inner summation. The remaining inner summation can be simplified with the binomial theorem.
      – Mike Earnest
      Jan 4 at 18:57










    • @user1942348 $3^n=(1+2)^n$. Now use the binomial theorem.
      – Arthur
      Jan 4 at 18:59


















    • Would you please write a bit more. How 3=1+2 and 2=1+1 helps?
      – user1942348
      Jan 4 at 16:53












    • @user1942348 After switching the order of summation, you can factor ${}^nC_i$ out of the inner summation. The remaining inner summation can be simplified with the binomial theorem.
      – Mike Earnest
      Jan 4 at 18:57










    • @user1942348 $3^n=(1+2)^n$. Now use the binomial theorem.
      – Arthur
      Jan 4 at 18:59
















    Would you please write a bit more. How 3=1+2 and 2=1+1 helps?
    – user1942348
    Jan 4 at 16:53






    Would you please write a bit more. How 3=1+2 and 2=1+1 helps?
    – user1942348
    Jan 4 at 16:53














    @user1942348 After switching the order of summation, you can factor ${}^nC_i$ out of the inner summation. The remaining inner summation can be simplified with the binomial theorem.
    – Mike Earnest
    Jan 4 at 18:57




    @user1942348 After switching the order of summation, you can factor ${}^nC_i$ out of the inner summation. The remaining inner summation can be simplified with the binomial theorem.
    – Mike Earnest
    Jan 4 at 18:57












    @user1942348 $3^n=(1+2)^n$. Now use the binomial theorem.
    – Arthur
    Jan 4 at 18:59




    @user1942348 $3^n=(1+2)^n$. Now use the binomial theorem.
    – Arthur
    Jan 4 at 18:59











    1














    First, let $S_{ij}$ be the set of words $s$ in ${0,1,2}^n$ that satisfy both of the following 1. and 2. below:




    1. Precisely $n-i$ of the letters of $s$ are "0", oe equivalently, precisely $i$ letters of $s$ are in ${1,2}$.

    2. Of the $i$ letters that are in ${1,2}$, there are precsiely $j$ of those letters that are "2".


    (So $n-i$ letters of each $s in S_{ij}$ are "0", $i-j$ letters of $s$ are "1", and the remaining $j$ letters of $s$ are "2".)



    On the one hand: $|S_{ij}|= {^nC_i} ,{^iC_j}$; first choose the $(n-i)$ out of $n$ positions of $s$ such that the letter in each such position is "0", and then from the remaining $i$ positions, choose the $j$ positions such that the letter in each such position is a "2". On the other hand, the $S_{ij}$s partition ${0,1,2}^n$, which has cardinality $3^n$. So this gives



    $$3^n = sum_{i=1}^n sum_{j=1}^i |S_{ij}| = sum_{j=1}^n sum_{i=j}^n |S_{ij}| = sum_{j=1}^nsum_{i=j}^n {^nC_i} ,{^iC_j}.$$






    share|cite|improve this answer




























      1














      First, let $S_{ij}$ be the set of words $s$ in ${0,1,2}^n$ that satisfy both of the following 1. and 2. below:




      1. Precisely $n-i$ of the letters of $s$ are "0", oe equivalently, precisely $i$ letters of $s$ are in ${1,2}$.

      2. Of the $i$ letters that are in ${1,2}$, there are precsiely $j$ of those letters that are "2".


      (So $n-i$ letters of each $s in S_{ij}$ are "0", $i-j$ letters of $s$ are "1", and the remaining $j$ letters of $s$ are "2".)



      On the one hand: $|S_{ij}|= {^nC_i} ,{^iC_j}$; first choose the $(n-i)$ out of $n$ positions of $s$ such that the letter in each such position is "0", and then from the remaining $i$ positions, choose the $j$ positions such that the letter in each such position is a "2". On the other hand, the $S_{ij}$s partition ${0,1,2}^n$, which has cardinality $3^n$. So this gives



      $$3^n = sum_{i=1}^n sum_{j=1}^i |S_{ij}| = sum_{j=1}^n sum_{i=j}^n |S_{ij}| = sum_{j=1}^nsum_{i=j}^n {^nC_i} ,{^iC_j}.$$






      share|cite|improve this answer


























        1












        1








        1






        First, let $S_{ij}$ be the set of words $s$ in ${0,1,2}^n$ that satisfy both of the following 1. and 2. below:




        1. Precisely $n-i$ of the letters of $s$ are "0", oe equivalently, precisely $i$ letters of $s$ are in ${1,2}$.

        2. Of the $i$ letters that are in ${1,2}$, there are precsiely $j$ of those letters that are "2".


        (So $n-i$ letters of each $s in S_{ij}$ are "0", $i-j$ letters of $s$ are "1", and the remaining $j$ letters of $s$ are "2".)



        On the one hand: $|S_{ij}|= {^nC_i} ,{^iC_j}$; first choose the $(n-i)$ out of $n$ positions of $s$ such that the letter in each such position is "0", and then from the remaining $i$ positions, choose the $j$ positions such that the letter in each such position is a "2". On the other hand, the $S_{ij}$s partition ${0,1,2}^n$, which has cardinality $3^n$. So this gives



        $$3^n = sum_{i=1}^n sum_{j=1}^i |S_{ij}| = sum_{j=1}^n sum_{i=j}^n |S_{ij}| = sum_{j=1}^nsum_{i=j}^n {^nC_i} ,{^iC_j}.$$






        share|cite|improve this answer














        First, let $S_{ij}$ be the set of words $s$ in ${0,1,2}^n$ that satisfy both of the following 1. and 2. below:




        1. Precisely $n-i$ of the letters of $s$ are "0", oe equivalently, precisely $i$ letters of $s$ are in ${1,2}$.

        2. Of the $i$ letters that are in ${1,2}$, there are precsiely $j$ of those letters that are "2".


        (So $n-i$ letters of each $s in S_{ij}$ are "0", $i-j$ letters of $s$ are "1", and the remaining $j$ letters of $s$ are "2".)



        On the one hand: $|S_{ij}|= {^nC_i} ,{^iC_j}$; first choose the $(n-i)$ out of $n$ positions of $s$ such that the letter in each such position is "0", and then from the remaining $i$ positions, choose the $j$ positions such that the letter in each such position is a "2". On the other hand, the $S_{ij}$s partition ${0,1,2}^n$, which has cardinality $3^n$. So this gives



        $$3^n = sum_{i=1}^n sum_{j=1}^i |S_{ij}| = sum_{j=1}^n sum_{i=j}^n |S_{ij}| = sum_{j=1}^nsum_{i=j}^n {^nC_i} ,{^iC_j}.$$







        share|cite|improve this answer














        share|cite|improve this answer



        share|cite|improve this answer








        edited Jan 4 at 19:52

























        answered Jan 4 at 19:31









        MikeMike

        3,148311




        3,148311






























            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.





            Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


            Please pay close attention to the following guidance:


            • 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.


            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%2f3061776%2fprove-that-sum-j-0n-sum-i-jn-nc-i-ic-j-3n%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

            An IMO inspired problem

            Image
            14 4 This problem from IMO 1988 is said to be one of the most elegant ones in functional equations. Problem : The function $f$ is defined on the set of all positive integers as follows: begin{align} f(1) = 1, f(3) &= 3, f(2n) = f(n), \ f(4n+1) &= 2f(2n+1) - f(n), \ f(4n+3) &= 3 f(2n+1) - 2f(n) end{align} Find the number of $n$ with $f(n) = n, 1 leq n leq 1988$. The main idea towards the solution is realizing that these conditions stand for the fact that $f(n)$ just reverses the digits in the binary representation of the number $n$. So, essentially the solution is finding the number of binary pallindromes $leq 1988_{10}$. My question is the following : How to reformulate the problem so that $f(n)$ reverses the digits of $n$ in its ternary representation. Or even better, can we reformulate it for a
            Read more

            Management

            Image
            Management From Wikipedia, the free encyclopedia Jump to navigation Jump to search "Manager" redirects here. For other uses, see Management (disambiguation) and Manager (disambiguation). An organization chart for the United States Coast Guard shows the hierarchy of managerial roles in that organization. Business administration Management of a business Accounting Management accounting Financial accounting Financial audit Business entities Cooperative Corporation Limited liability company Partnership Sole proprietorship State-owned enterprise Corporate governance Annual general meeting Board of directors Supervisory board Advisory board Audit committee Corporate law Commercial law Constitutional documents Contract Corporate crime Corporate liability Insolvency law International trade law Mergers and acquisitions Economics Commodity Pu
            Read more

            Investment

            Image
            Investment From Wikipedia, the free encyclopedia Jump to navigation Jump to search This article is about investment in finance. For investment in macroeconomics, see Investment (macroeconomics). For other uses, see Investment (disambiguation). "Invest" redirects here. For the term in meteorology, see Invest (meteorology). This article needs additional citations for verification . Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. ( February 2017 ) (Learn how and when to remove this template message) In general, to invest is to distribute money in the expectation of some benefit in the future – for example, investment in durable goods, in real estate by the service industry, in factories for manufacturing, in product development, and in research and development. However, this article focuses specifically on investment in financial
            Read more