Prove by induction that $sumlimits_{k=m}^{ n}{nchoose k}{kchoose m}={nchoose m}2^{n-m}$.












1















Prove by induction that $displaystylesumlimits_{k=m}^{ n}{nchoose k}{kchoose m}={nchoose m}2^{n-m}$.




I can't figure out what is the base case. Could someone show the steps?






combinatorics discrete-mathematics summation induction binomial-coefficients







share|cite|improve this question




















  • 2




    The obvious base case is $n = m$, and then induction on $n$. But a little rewriting of the terms of the sum makes the proof much [I think, maybe the induction is easier than I expect] easier.
    – Daniel Fischer♦
    Jun 20 '15 at 22:58










  • If you do not insist on induction, there are several posts with the same sum: math.stackexchange.com/questions/203198/… math.stackexchange.com/questions/380555/… math.stackexchange.com/questions/1640706/… I found the above questions using Approach0.
    – Martin Sleziak
    Nov 16 '16 at 4:49
















1















Prove by induction that $displaystylesumlimits_{k=m}^{ n}{nchoose k}{kchoose m}={nchoose m}2^{n-m}$.




I can't figure out what is the base case. Could someone show the steps?






combinatorics discrete-mathematics summation induction binomial-coefficients







share|cite|improve this question




















  • 2




    The obvious base case is $n = m$, and then induction on $n$. But a little rewriting of the terms of the sum makes the proof much [I think, maybe the induction is easier than I expect] easier.
    – Daniel Fischer♦
    Jun 20 '15 at 22:58










  • If you do not insist on induction, there are several posts with the same sum: math.stackexchange.com/questions/203198/… math.stackexchange.com/questions/380555/… math.stackexchange.com/questions/1640706/… I found the above questions using Approach0.
    – Martin Sleziak
    Nov 16 '16 at 4:49














1












1








1


1






Prove by induction that $displaystylesumlimits_{k=m}^{ n}{nchoose k}{kchoose m}={nchoose m}2^{n-m}$.




I can't figure out what is the base case. Could someone show the steps?






combinatorics discrete-mathematics summation induction binomial-coefficients







share|cite|improve this question
















Prove by induction that $displaystylesumlimits_{k=m}^{ n}{nchoose k}{kchoose m}={nchoose m}2^{n-m}$.




I can't figure out what is the base case. Could someone show the steps?






combinatorics discrete-mathematics summation induction binomial-coefficients




combinatorics discrete-mathematics summation induction binomial-coefficients






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 10 '18 at 9:51









Batominovski

33.8k33292




33.8k33292










asked Jun 20 '15 at 22:44









user300045

1,349418




1,349418








  • 2




    The obvious base case is $n = m$, and then induction on $n$. But a little rewriting of the terms of the sum makes the proof much [I think, maybe the induction is easier than I expect] easier.
    – Daniel Fischer♦
    Jun 20 '15 at 22:58










  • If you do not insist on induction, there are several posts with the same sum: math.stackexchange.com/questions/203198/… math.stackexchange.com/questions/380555/… math.stackexchange.com/questions/1640706/… I found the above questions using Approach0.
    – Martin Sleziak
    Nov 16 '16 at 4:49














  • 2




    The obvious base case is $n = m$, and then induction on $n$. But a little rewriting of the terms of the sum makes the proof much [I think, maybe the induction is easier than I expect] easier.
    – Daniel Fischer♦
    Jun 20 '15 at 22:58










  • If you do not insist on induction, there are several posts with the same sum: math.stackexchange.com/questions/203198/… math.stackexchange.com/questions/380555/… math.stackexchange.com/questions/1640706/… I found the above questions using Approach0.
    – Martin Sleziak
    Nov 16 '16 at 4:49








2




2




The obvious base case is $n = m$, and then induction on $n$. But a little rewriting of the terms of the sum makes the proof much [I think, maybe the induction is easier than I expect] easier.
– Daniel Fischer♦
Jun 20 '15 at 22:58




The obvious base case is $n = m$, and then induction on $n$. But a little rewriting of the terms of the sum makes the proof much [I think, maybe the induction is easier than I expect] easier.
– Daniel Fischer♦
Jun 20 '15 at 22:58












If you do not insist on induction, there are several posts with the same sum: math.stackexchange.com/questions/203198/… math.stackexchange.com/questions/380555/… math.stackexchange.com/questions/1640706/… I found the above questions using Approach0.
– Martin Sleziak
Nov 16 '16 at 4:49




If you do not insist on induction, there are several posts with the same sum: math.stackexchange.com/questions/203198/… math.stackexchange.com/questions/380555/… math.stackexchange.com/questions/1640706/… I found the above questions using Approach0.
– Martin Sleziak
Nov 16 '16 at 4:49










2 Answers
2






active

oldest

votes


















5














We may write the required equality as
$$sum_{k=0}^n,binom{n}{k},binom{k}{m}=binom{n}{m},2^{n-m}$$
for all integers $n,mgeq 0$, using the convention that $displaystylebinom{p}{q}=0$ for integers $p,qgeq 0$ such that $p<q$. We shall prove by induction on $m$ the generalized statement:
$$sum_{k=0}^n,binom{n}{k},binom{k}{m},x^{k-m}=binom{n}{m},(1+x)^{n-m},,$$
where $x:=1$ leads to the required equality. The basis step is $m=0$, where we have the well known Binomial Theorem $$sum_{k=0}^n,binom{n}{k},binom{k}{0},x^{k-0}=sum_{k=0}^n,binom{n}{k},x^k=(1+x)^n=binom{n}{0},(1+x)^{n-0},.$$



Now, suppose the identity is true when $m=s$ for some integer $sgeq 0$ (and for all integer $ngeq 0$). Therefore, we have $$sum_{k=0}^{n},binom{n}{k},binom{k}{s},x^{k-s}=binom{n}{s},(1+x)^{n-s},.$$
for all integer $ngeq 0$. Taking the derivative with respect to $x$, we obtain
$$sum_{k=0}^{n},binom{n}{k},binom{k}{s},(k-s),x^{k-s-1}=binom{n}{s},(n-s),(1+x)^{n-s-1},.$$
Dividing both sides by $s+1$ to get
$$sum_{k=0}^n,binom{n}{k},binom{k}{s},frac{k-s}{s+1},x^{k-(s+1)}=binom{n}{s},frac{n-s}{s+1},(1+x)^{n-(s+1)},.$$
Since $displaystylebinom{p}{s},frac{p-s}{s+1}=binom{p}{s+1}$ for every integer $pgeq 0$, we get the desired equality
$$sum_{k=0}^n,binom{n}{k},binom{k}{s+1},x^{k-(s+1)}=binom{n}{s+1},(1+x)^{n-(s+1)},,$$
establishing that the required equality holds for $m=s+1$. By induction, we are done.




Alternatively, consider a task of choosing a committee from $n$ people, where $m$ committee members are given the chief status. If the committee has $k$ members, then there are $displaystylebinom{n}{k}$ ways to choose the committee and $displaystylebinom{k}{m}$ ways to choose the chiefs. Hence, the number of ways to perform this task is precisely $displaystylesumlimits_{k=m}^n,binom{n}{k},binom{k}{m}$. On the other hand, we may chose $m$ chiefs first, whereby there are are $displaystylebinom{n}{m}$ ways to do so. The non-chief committee members are then selected from $n-m$ remaining people, which can be done in $2^{n-m}$ ways. Hence, we can perform this task in $displaystylebinom{n}{m},2^{n-m}$ ways. The proof is now complete.






share|cite|improve this answer























  • +1 for a nice combinatorial solution! when such a representation can be found, it is the most aesthetically satisfying demonstration
    – David Holden
    Jun 21 '15 at 0:38



















4














you can get by without induction if you observe:
$$
binom{n}{k} binom{k}{m} = binom{n}{m} binom{n-m}{k-m}
$$
then
$$
sum_{k=m}^n binom{n}{k} binom{k}{m} = binom{n}{m}sum_{j=0}^{n-m}binom{n-m}{j} = binom{n}{m}2^{n-m}
$$






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%2f1333148%2fprove-by-induction-that-sum-limits-k-m-nn-choose-kk-choose-m-n-choo%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









    5














    We may write the required equality as
    $$sum_{k=0}^n,binom{n}{k},binom{k}{m}=binom{n}{m},2^{n-m}$$
    for all integers $n,mgeq 0$, using the convention that $displaystylebinom{p}{q}=0$ for integers $p,qgeq 0$ such that $p<q$. We shall prove by induction on $m$ the generalized statement:
    $$sum_{k=0}^n,binom{n}{k},binom{k}{m},x^{k-m}=binom{n}{m},(1+x)^{n-m},,$$
    where $x:=1$ leads to the required equality. The basis step is $m=0$, where we have the well known Binomial Theorem $$sum_{k=0}^n,binom{n}{k},binom{k}{0},x^{k-0}=sum_{k=0}^n,binom{n}{k},x^k=(1+x)^n=binom{n}{0},(1+x)^{n-0},.$$



    Now, suppose the identity is true when $m=s$ for some integer $sgeq 0$ (and for all integer $ngeq 0$). Therefore, we have $$sum_{k=0}^{n},binom{n}{k},binom{k}{s},x^{k-s}=binom{n}{s},(1+x)^{n-s},.$$
    for all integer $ngeq 0$. Taking the derivative with respect to $x$, we obtain
    $$sum_{k=0}^{n},binom{n}{k},binom{k}{s},(k-s),x^{k-s-1}=binom{n}{s},(n-s),(1+x)^{n-s-1},.$$
    Dividing both sides by $s+1$ to get
    $$sum_{k=0}^n,binom{n}{k},binom{k}{s},frac{k-s}{s+1},x^{k-(s+1)}=binom{n}{s},frac{n-s}{s+1},(1+x)^{n-(s+1)},.$$
    Since $displaystylebinom{p}{s},frac{p-s}{s+1}=binom{p}{s+1}$ for every integer $pgeq 0$, we get the desired equality
    $$sum_{k=0}^n,binom{n}{k},binom{k}{s+1},x^{k-(s+1)}=binom{n}{s+1},(1+x)^{n-(s+1)},,$$
    establishing that the required equality holds for $m=s+1$. By induction, we are done.




    Alternatively, consider a task of choosing a committee from $n$ people, where $m$ committee members are given the chief status. If the committee has $k$ members, then there are $displaystylebinom{n}{k}$ ways to choose the committee and $displaystylebinom{k}{m}$ ways to choose the chiefs. Hence, the number of ways to perform this task is precisely $displaystylesumlimits_{k=m}^n,binom{n}{k},binom{k}{m}$. On the other hand, we may chose $m$ chiefs first, whereby there are are $displaystylebinom{n}{m}$ ways to do so. The non-chief committee members are then selected from $n-m$ remaining people, which can be done in $2^{n-m}$ ways. Hence, we can perform this task in $displaystylebinom{n}{m},2^{n-m}$ ways. The proof is now complete.






    share|cite|improve this answer























    • +1 for a nice combinatorial solution! when such a representation can be found, it is the most aesthetically satisfying demonstration
      – David Holden
      Jun 21 '15 at 0:38
















    5














    We may write the required equality as
    $$sum_{k=0}^n,binom{n}{k},binom{k}{m}=binom{n}{m},2^{n-m}$$
    for all integers $n,mgeq 0$, using the convention that $displaystylebinom{p}{q}=0$ for integers $p,qgeq 0$ such that $p<q$. We shall prove by induction on $m$ the generalized statement:
    $$sum_{k=0}^n,binom{n}{k},binom{k}{m},x^{k-m}=binom{n}{m},(1+x)^{n-m},,$$
    where $x:=1$ leads to the required equality. The basis step is $m=0$, where we have the well known Binomial Theorem $$sum_{k=0}^n,binom{n}{k},binom{k}{0},x^{k-0}=sum_{k=0}^n,binom{n}{k},x^k=(1+x)^n=binom{n}{0},(1+x)^{n-0},.$$



    Now, suppose the identity is true when $m=s$ for some integer $sgeq 0$ (and for all integer $ngeq 0$). Therefore, we have $$sum_{k=0}^{n},binom{n}{k},binom{k}{s},x^{k-s}=binom{n}{s},(1+x)^{n-s},.$$
    for all integer $ngeq 0$. Taking the derivative with respect to $x$, we obtain
    $$sum_{k=0}^{n},binom{n}{k},binom{k}{s},(k-s),x^{k-s-1}=binom{n}{s},(n-s),(1+x)^{n-s-1},.$$
    Dividing both sides by $s+1$ to get
    $$sum_{k=0}^n,binom{n}{k},binom{k}{s},frac{k-s}{s+1},x^{k-(s+1)}=binom{n}{s},frac{n-s}{s+1},(1+x)^{n-(s+1)},.$$
    Since $displaystylebinom{p}{s},frac{p-s}{s+1}=binom{p}{s+1}$ for every integer $pgeq 0$, we get the desired equality
    $$sum_{k=0}^n,binom{n}{k},binom{k}{s+1},x^{k-(s+1)}=binom{n}{s+1},(1+x)^{n-(s+1)},,$$
    establishing that the required equality holds for $m=s+1$. By induction, we are done.




    Alternatively, consider a task of choosing a committee from $n$ people, where $m$ committee members are given the chief status. If the committee has $k$ members, then there are $displaystylebinom{n}{k}$ ways to choose the committee and $displaystylebinom{k}{m}$ ways to choose the chiefs. Hence, the number of ways to perform this task is precisely $displaystylesumlimits_{k=m}^n,binom{n}{k},binom{k}{m}$. On the other hand, we may chose $m$ chiefs first, whereby there are are $displaystylebinom{n}{m}$ ways to do so. The non-chief committee members are then selected from $n-m$ remaining people, which can be done in $2^{n-m}$ ways. Hence, we can perform this task in $displaystylebinom{n}{m},2^{n-m}$ ways. The proof is now complete.






    share|cite|improve this answer























    • +1 for a nice combinatorial solution! when such a representation can be found, it is the most aesthetically satisfying demonstration
      – David Holden
      Jun 21 '15 at 0:38














    5












    5








    5






    We may write the required equality as
    $$sum_{k=0}^n,binom{n}{k},binom{k}{m}=binom{n}{m},2^{n-m}$$
    for all integers $n,mgeq 0$, using the convention that $displaystylebinom{p}{q}=0$ for integers $p,qgeq 0$ such that $p<q$. We shall prove by induction on $m$ the generalized statement:
    $$sum_{k=0}^n,binom{n}{k},binom{k}{m},x^{k-m}=binom{n}{m},(1+x)^{n-m},,$$
    where $x:=1$ leads to the required equality. The basis step is $m=0$, where we have the well known Binomial Theorem $$sum_{k=0}^n,binom{n}{k},binom{k}{0},x^{k-0}=sum_{k=0}^n,binom{n}{k},x^k=(1+x)^n=binom{n}{0},(1+x)^{n-0},.$$



    Now, suppose the identity is true when $m=s$ for some integer $sgeq 0$ (and for all integer $ngeq 0$). Therefore, we have $$sum_{k=0}^{n},binom{n}{k},binom{k}{s},x^{k-s}=binom{n}{s},(1+x)^{n-s},.$$
    for all integer $ngeq 0$. Taking the derivative with respect to $x$, we obtain
    $$sum_{k=0}^{n},binom{n}{k},binom{k}{s},(k-s),x^{k-s-1}=binom{n}{s},(n-s),(1+x)^{n-s-1},.$$
    Dividing both sides by $s+1$ to get
    $$sum_{k=0}^n,binom{n}{k},binom{k}{s},frac{k-s}{s+1},x^{k-(s+1)}=binom{n}{s},frac{n-s}{s+1},(1+x)^{n-(s+1)},.$$
    Since $displaystylebinom{p}{s},frac{p-s}{s+1}=binom{p}{s+1}$ for every integer $pgeq 0$, we get the desired equality
    $$sum_{k=0}^n,binom{n}{k},binom{k}{s+1},x^{k-(s+1)}=binom{n}{s+1},(1+x)^{n-(s+1)},,$$
    establishing that the required equality holds for $m=s+1$. By induction, we are done.




    Alternatively, consider a task of choosing a committee from $n$ people, where $m$ committee members are given the chief status. If the committee has $k$ members, then there are $displaystylebinom{n}{k}$ ways to choose the committee and $displaystylebinom{k}{m}$ ways to choose the chiefs. Hence, the number of ways to perform this task is precisely $displaystylesumlimits_{k=m}^n,binom{n}{k},binom{k}{m}$. On the other hand, we may chose $m$ chiefs first, whereby there are are $displaystylebinom{n}{m}$ ways to do so. The non-chief committee members are then selected from $n-m$ remaining people, which can be done in $2^{n-m}$ ways. Hence, we can perform this task in $displaystylebinom{n}{m},2^{n-m}$ ways. The proof is now complete.






    share|cite|improve this answer














    We may write the required equality as
    $$sum_{k=0}^n,binom{n}{k},binom{k}{m}=binom{n}{m},2^{n-m}$$
    for all integers $n,mgeq 0$, using the convention that $displaystylebinom{p}{q}=0$ for integers $p,qgeq 0$ such that $p<q$. We shall prove by induction on $m$ the generalized statement:
    $$sum_{k=0}^n,binom{n}{k},binom{k}{m},x^{k-m}=binom{n}{m},(1+x)^{n-m},,$$
    where $x:=1$ leads to the required equality. The basis step is $m=0$, where we have the well known Binomial Theorem $$sum_{k=0}^n,binom{n}{k},binom{k}{0},x^{k-0}=sum_{k=0}^n,binom{n}{k},x^k=(1+x)^n=binom{n}{0},(1+x)^{n-0},.$$



    Now, suppose the identity is true when $m=s$ for some integer $sgeq 0$ (and for all integer $ngeq 0$). Therefore, we have $$sum_{k=0}^{n},binom{n}{k},binom{k}{s},x^{k-s}=binom{n}{s},(1+x)^{n-s},.$$
    for all integer $ngeq 0$. Taking the derivative with respect to $x$, we obtain
    $$sum_{k=0}^{n},binom{n}{k},binom{k}{s},(k-s),x^{k-s-1}=binom{n}{s},(n-s),(1+x)^{n-s-1},.$$
    Dividing both sides by $s+1$ to get
    $$sum_{k=0}^n,binom{n}{k},binom{k}{s},frac{k-s}{s+1},x^{k-(s+1)}=binom{n}{s},frac{n-s}{s+1},(1+x)^{n-(s+1)},.$$
    Since $displaystylebinom{p}{s},frac{p-s}{s+1}=binom{p}{s+1}$ for every integer $pgeq 0$, we get the desired equality
    $$sum_{k=0}^n,binom{n}{k},binom{k}{s+1},x^{k-(s+1)}=binom{n}{s+1},(1+x)^{n-(s+1)},,$$
    establishing that the required equality holds for $m=s+1$. By induction, we are done.




    Alternatively, consider a task of choosing a committee from $n$ people, where $m$ committee members are given the chief status. If the committee has $k$ members, then there are $displaystylebinom{n}{k}$ ways to choose the committee and $displaystylebinom{k}{m}$ ways to choose the chiefs. Hence, the number of ways to perform this task is precisely $displaystylesumlimits_{k=m}^n,binom{n}{k},binom{k}{m}$. On the other hand, we may chose $m$ chiefs first, whereby there are are $displaystylebinom{n}{m}$ ways to do so. The non-chief committee members are then selected from $n-m$ remaining people, which can be done in $2^{n-m}$ ways. Hence, we can perform this task in $displaystylebinom{n}{m},2^{n-m}$ ways. The proof is now complete.







    share|cite|improve this answer














    share|cite|improve this answer



    share|cite|improve this answer








    edited Dec 10 '18 at 10:46

























    answered Jun 21 '15 at 0:24









    Batominovski

    33.8k33292




    33.8k33292












    • +1 for a nice combinatorial solution! when such a representation can be found, it is the most aesthetically satisfying demonstration
      – David Holden
      Jun 21 '15 at 0:38


















    • +1 for a nice combinatorial solution! when such a representation can be found, it is the most aesthetically satisfying demonstration
      – David Holden
      Jun 21 '15 at 0:38
















    +1 for a nice combinatorial solution! when such a representation can be found, it is the most aesthetically satisfying demonstration
    – David Holden
    Jun 21 '15 at 0:38




    +1 for a nice combinatorial solution! when such a representation can be found, it is the most aesthetically satisfying demonstration
    – David Holden
    Jun 21 '15 at 0:38











    4














    you can get by without induction if you observe:
    $$
    binom{n}{k} binom{k}{m} = binom{n}{m} binom{n-m}{k-m}
    $$
    then
    $$
    sum_{k=m}^n binom{n}{k} binom{k}{m} = binom{n}{m}sum_{j=0}^{n-m}binom{n-m}{j} = binom{n}{m}2^{n-m}
    $$






    share|cite|improve this answer


























      4














      you can get by without induction if you observe:
      $$
      binom{n}{k} binom{k}{m} = binom{n}{m} binom{n-m}{k-m}
      $$
      then
      $$
      sum_{k=m}^n binom{n}{k} binom{k}{m} = binom{n}{m}sum_{j=0}^{n-m}binom{n-m}{j} = binom{n}{m}2^{n-m}
      $$






      share|cite|improve this answer
























        4












        4








        4






        you can get by without induction if you observe:
        $$
        binom{n}{k} binom{k}{m} = binom{n}{m} binom{n-m}{k-m}
        $$
        then
        $$
        sum_{k=m}^n binom{n}{k} binom{k}{m} = binom{n}{m}sum_{j=0}^{n-m}binom{n-m}{j} = binom{n}{m}2^{n-m}
        $$






        share|cite|improve this answer












        you can get by without induction if you observe:
        $$
        binom{n}{k} binom{k}{m} = binom{n}{m} binom{n-m}{k-m}
        $$
        then
        $$
        sum_{k=m}^n binom{n}{k} binom{k}{m} = binom{n}{m}sum_{j=0}^{n-m}binom{n-m}{j} = binom{n}{m}2^{n-m}
        $$







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Jun 21 '15 at 0:08









        David Holden

        14.7k21224




        14.7k21224






























            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%2f1333148%2fprove-by-induction-that-sum-limits-k-m-nn-choose-kk-choose-m-n-choo%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

            Bressuire

            Image
            .mw-parser-output .infobox{border:1px solid #aaa;background-color:#f9f9f9;color:black;margin:.5em 0 .5em 1em;padding:.2em;float:right;clear:right;width:22em;text-align:left;font-size:88%;line-height:1.6em}.mw-parser-output .infobox td,.mw-parser-output .infobox th{vertical-align:top;padding:0 .2em}.mw-parser-output .infobox caption{font-size:larger}.mw-parser-output .infobox.bordered{border-collapse:collapse}.mw-parser-output .infobox.bordered td,.mw-parser-output .infobox.bordered th{border:1px solid #aaa}.mw-parser-output .infobox.bordered .borderless td,.mw-parser-output .infobox.bordered .borderless th{border:0}.mw-parser-output .infobox-showbutton .mw-collapsible-text{color:inherit}.mw-parser-output .infobox.bordered .mergedtoprow td,.mw-parser-output .infobox.bordered .mergedtoprow th{border:0;border-top:1px solid #aaa;border-right:1px solid #aaa}.mw-parser-output .infobox.bordered .mergedrow td,.mw-parser-output .infobox.bordered .mergedrow th{border:0;border-right:1px solid ...
            Read more

            Cabo Verde

            Image
              Nota: Cabo-verdiano redireciona para este artigo. Para a língua falada em Cabo Verde, veja crioulo cabo-verdiano. Para outros significados, veja Cabo Verde (desambiguação). Coordenadas: 14° 55' N 23° 31' O Cabo Verde República de Cabo Verde Bandeira Brasão de Armas Lema: Unidade, Trabalho, Progresso Hino nacional: Cântico da Liberdade Gentílico: cabo-verdiano [ 1 ] Capital Praia 14° 55' N 23° 31' O Cidade mais populosa Praia Língua oficial Português Governo República unitária semipresidencialista [ 2 ]  - Presidente Jorge Carlos Fonseca  - Primeiro-ministro Ulisses Correia e Silva História    - Descoberta 1460   - Independência 00 • de Portugal 5 de Julho de 1975   - Multipartidarismo 13 de Janeiro de 1990  Área    - Total 4 033 km² (146.º)  - Água (%) 0,08 População    - Estimativa para 2017 560 899 [ 3 ] hab. (173.º) ...
            Read more

            Gyllenstierna

            Image
            .mw-parser-output .infobox{border:1px solid #aaa;background-color:#f9f9f9;color:black;margin:.5em 0 .5em 1em;padding:.2em;float:right;clear:right;width:22em;text-align:left;font-size:88%;line-height:1.6em}.mw-parser-output .infobox td,.mw-parser-output .infobox th{vertical-align:top;padding:0 .2em}.mw-parser-output .infobox caption{font-size:larger}.mw-parser-output .infobox.bordered{border-collapse:collapse}.mw-parser-output .infobox.bordered td,.mw-parser-output .infobox.bordered th{border:1px solid #aaa}.mw-parser-output .infobox.bordered .borderless td,.mw-parser-output .infobox.bordered .borderless th{border:0}.mw-parser-output .infobox-showbutton .mw-collapsible-text{color:inherit}.mw-parser-output .infobox.bordered .mergedtoprow td,.mw-parser-output .infobox.bordered .mergedtoprow th{border:0;border-top:1px solid #aaa;border-right:1px solid #aaa}.mw-parser-output .infobox.bordered .mergedrow td,.mw-parser-output .infobox.bordered .mergedrow th{border:0;border-right:1px solid ...
            Read more