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












1












$begingroup$



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











$endgroup$








  • 2




    $begingroup$
    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.
    $endgroup$
    – Daniel Fischer
    Jun 20 '15 at 22:58










  • $begingroup$
    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.
    $endgroup$
    – Martin Sleziak
    Nov 16 '16 at 4:49
















1












$begingroup$



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











$endgroup$








  • 2




    $begingroup$
    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.
    $endgroup$
    – Daniel Fischer
    Jun 20 '15 at 22:58










  • $begingroup$
    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.
    $endgroup$
    – Martin Sleziak
    Nov 16 '16 at 4:49














1












1








1


1



$begingroup$



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











$endgroup$





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.1k33293




33.1k33293










asked Jun 20 '15 at 22:44









user300045user300045

1,394518




1,394518








  • 2




    $begingroup$
    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.
    $endgroup$
    – Daniel Fischer
    Jun 20 '15 at 22:58










  • $begingroup$
    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.
    $endgroup$
    – Martin Sleziak
    Nov 16 '16 at 4:49














  • 2




    $begingroup$
    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.
    $endgroup$
    – Daniel Fischer
    Jun 20 '15 at 22:58










  • $begingroup$
    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.
    $endgroup$
    – Martin Sleziak
    Nov 16 '16 at 4:49








2




2




$begingroup$
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.
$endgroup$
– Daniel Fischer
Jun 20 '15 at 22:58




$begingroup$
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.
$endgroup$
– Daniel Fischer
Jun 20 '15 at 22:58












$begingroup$
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.
$endgroup$
– Martin Sleziak
Nov 16 '16 at 4:49




$begingroup$
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.
$endgroup$
– Martin Sleziak
Nov 16 '16 at 4:49










2 Answers
2






active

oldest

votes


















5












$begingroup$

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











$endgroup$













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



















4












$begingroup$

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









$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%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












    $begingroup$

    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











    $endgroup$













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
















    5












    $begingroup$

    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











    $endgroup$













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














    5












    5








    5





    $begingroup$

    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











    $endgroup$



    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









    BatominovskiBatominovski

    33.1k33293




    33.1k33293












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


















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
















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




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











    4












    $begingroup$

    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









    $endgroup$


















      4












      $begingroup$

      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









      $endgroup$
















        4












        4








        4





        $begingroup$

        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









        $endgroup$



        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 HoldenDavid Holden

        14.9k21225




        14.9k21225






























            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%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

            Biblatex bibliography style without URLs when DOI exists (in Overleaf with Zotero bibliography)

            Image
            2 2 I have a Zotero bibliography in Overleaf. I use biblatex . usepackage[backend=biber,citestyle=authoryear]{biblatex} addbibresource{zoteroALH.bib} Bibliography entries look like: @book{de_saint-gervais_uniformization_2016, title = {Uniformization of {Riemann} {Surfaces}}, isbn = {978-3-03719-145-3}, url = {https://www.ems-ph.org/books/book.php?proj_nr=198&srch=series%7Chem}, urldate = {2019-02-03}, author = {de Saint-Gervais, Paul Henri}, year = {2016}, doi = {10.4171/145} } In the bibliography down the paper the reference shows like this: There is the DOI, great, but also the URL which is unnecessary when the DOI is there. How can I remove the URL when the DOI is present? biblatex bibliographies overleaf zote
            Read more

            ComboBox Display Member on multiple fields

            Image
            2 I'm trying to set the .DisplayMember property of a ComboBox in C#, but I want to bind it to multiple columns in the .DataSouce . My SQL looks like this: SELECT PersNbr, PersFirstName, PersMiddleName, PersLastName FROM Pers WHERE PersNbr = :persNbr; I'm saving this query in a DataTable so each column selected has it's own column in the Datatable . I want to make the .DisplayMember a combination of PersFirstName + PersMiddleName + PersLastName so their full name appears like this: comboBox.DisplayMemeber = "PersFirstName" + "PersMiddleName" + "PersLastName" I know I can just to this on the query: SELECT PersNbr, (PersFirstName || PersMiddleName || PersLastName) PersName and then just do this: comboBox.DisplayMember = "PersName"; but I
            Read more

            Is it possible to collect Nectar points via Trainline?

            Image
            2 Since I am not eligible for any Railcard, the only available discount/bonus scheme is Nectar Card for me. GWR, SWR, LNER and Virgin Trains allow to collect Nectar points and I have already linked a card to my GWR account. A friend suggested me to use Trainline App, because it can search for bus tickets either. I had a look at the application, but could not see any option for Nectar. Is there a way to collect Nectar points when I buy tickets via Trainline? uk trains loyalty-programs trainline share | improve this question asked Dec 2 '18 at 15:50 ahmedus 3,224 5 19 49
            Read more