Prove $sum_{r=2}^n {n choose r} r(r-1) = n(n-1)2^{n-2}$ for $ngeq 2$












1














How to prove following:



$$sum_{r=2}^n {n choose r} r(r-1) = n(n-1)2^{n-2}$$ for $ngeq 2$



Thanks!!






discrete-mathematics proof-explanation







share|cite|improve this question




















  • 1




    I'd use induction. Start with $n = 2$ and then prove that if the statement is valid for $n$ it is also valid for $n+1$. Basically, people get more enthusiastic about questions if the poster shows hir/her efforts
    – Ronald
    Dec 6 at 10:17
















1














How to prove following:



$$sum_{r=2}^n {n choose r} r(r-1) = n(n-1)2^{n-2}$$ for $ngeq 2$



Thanks!!






discrete-mathematics proof-explanation







share|cite|improve this question




















  • 1




    I'd use induction. Start with $n = 2$ and then prove that if the statement is valid for $n$ it is also valid for $n+1$. Basically, people get more enthusiastic about questions if the poster shows hir/her efforts
    – Ronald
    Dec 6 at 10:17














1












1








1







How to prove following:



$$sum_{r=2}^n {n choose r} r(r-1) = n(n-1)2^{n-2}$$ for $ngeq 2$



Thanks!!






discrete-mathematics proof-explanation







share|cite|improve this question















How to prove following:



$$sum_{r=2}^n {n choose r} r(r-1) = n(n-1)2^{n-2}$$ for $ngeq 2$



Thanks!!






discrete-mathematics proof-explanation




discrete-mathematics proof-explanation






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 6 at 10:21









greedoid

37.1k114794




37.1k114794










asked Dec 6 at 10:15









Timgascd

303




303








  • 1




    I'd use induction. Start with $n = 2$ and then prove that if the statement is valid for $n$ it is also valid for $n+1$. Basically, people get more enthusiastic about questions if the poster shows hir/her efforts
    – Ronald
    Dec 6 at 10:17














  • 1




    I'd use induction. Start with $n = 2$ and then prove that if the statement is valid for $n$ it is also valid for $n+1$. Basically, people get more enthusiastic about questions if the poster shows hir/her efforts
    – Ronald
    Dec 6 at 10:17








1




1




I'd use induction. Start with $n = 2$ and then prove that if the statement is valid for $n$ it is also valid for $n+1$. Basically, people get more enthusiastic about questions if the poster shows hir/her efforts
– Ronald
Dec 6 at 10:17




I'd use induction. Start with $n = 2$ and then prove that if the statement is valid for $n$ it is also valid for $n+1$. Basically, people get more enthusiastic about questions if the poster shows hir/her efforts
– Ronald
Dec 6 at 10:17










3 Answers
3






active

oldest

votes


















0














Hint:



For $r(r-1)ne0$



$$r(r-1)binom nr=r(r-1)n(n-1)dfrac{(n-2)!}{r(r-1)cdot(r-2)!cdot{n-2-(r-2)}!}=n(n-1)binom{n-2}{r-2}$$



Now in
$$(a+b)^m=sum_{r=0}^mbinom mr a^{m-r}b^r$$



put $a=b=1, m=n-2$



Some observations :




  1. $$sum_{r=2}^nbinom nrr(r-1)=sum_{r=0}^nbinom nrr(r-1)$$


  2. The proposition trivially holds true for $n=0,1$







share|cite|improve this answer





















  • Sorry, I do not really understand all of them. Can you explain it in detail? Thanks
    – Timgascd
    Dec 6 at 10:41










  • @Hgascd, All of them or none of them? $$binom nr=dfrac{n!}{(n-r)! r!}=dfrac{n(n-1)}{r(r-1)}cdotdfrac{(n-2)!}{(r-2)!cdot{n-2-(r-2)}!}=$$
    – lab bhattacharjee
    Dec 6 at 10:55












  • Thanks a lot. I got it
    – Timgascd
    Dec 6 at 11:04



















1














Question: On how many ways can we choose a group in a set of $n$ people and then president and then vicepresident?



Well we can first a group of $r$ people, that is ${nchoose r}$, for every $rleq n$, and then president among them, so we have $r$ choises and then $r-1$ choises for V.P. Suming (we can sum from $0$) for all $r$ we get:



$$sum_{r=0}^{n} r(r-1)C_{n}^{r} $$



On the other hand we can first choose a president among all people, so we have $n$ posibilities and then V.P. for who we have $n-1$ choises and then we choose any set in set of $n-2$ people, for that we have $2^{n-2}$ choises, so:



$$n(n-1)2^{n-2}$$ and this is the answer to your question.






share|cite|improve this answer





























    0














    Hint: Take $f(x)=(1+x)^n$ and consider $f''(1)$.






    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%2f3028304%2fprove-sum-r-2n-n-choose-r-rr-1-nn-12n-2-for-n-geq-2%23new-answer', 'question_page');
      }
      );

      Post as a guest















      Required, but never shown

























      3 Answers
      3






      active

      oldest

      votes








      3 Answers
      3






      active

      oldest

      votes









      active

      oldest

      votes






      active

      oldest

      votes









      0














      Hint:



      For $r(r-1)ne0$



      $$r(r-1)binom nr=r(r-1)n(n-1)dfrac{(n-2)!}{r(r-1)cdot(r-2)!cdot{n-2-(r-2)}!}=n(n-1)binom{n-2}{r-2}$$



      Now in
      $$(a+b)^m=sum_{r=0}^mbinom mr a^{m-r}b^r$$



      put $a=b=1, m=n-2$



      Some observations :




      1. $$sum_{r=2}^nbinom nrr(r-1)=sum_{r=0}^nbinom nrr(r-1)$$


      2. The proposition trivially holds true for $n=0,1$







      share|cite|improve this answer





















      • Sorry, I do not really understand all of them. Can you explain it in detail? Thanks
        – Timgascd
        Dec 6 at 10:41










      • @Hgascd, All of them or none of them? $$binom nr=dfrac{n!}{(n-r)! r!}=dfrac{n(n-1)}{r(r-1)}cdotdfrac{(n-2)!}{(r-2)!cdot{n-2-(r-2)}!}=$$
        – lab bhattacharjee
        Dec 6 at 10:55












      • Thanks a lot. I got it
        – Timgascd
        Dec 6 at 11:04
















      0














      Hint:



      For $r(r-1)ne0$



      $$r(r-1)binom nr=r(r-1)n(n-1)dfrac{(n-2)!}{r(r-1)cdot(r-2)!cdot{n-2-(r-2)}!}=n(n-1)binom{n-2}{r-2}$$



      Now in
      $$(a+b)^m=sum_{r=0}^mbinom mr a^{m-r}b^r$$



      put $a=b=1, m=n-2$



      Some observations :




      1. $$sum_{r=2}^nbinom nrr(r-1)=sum_{r=0}^nbinom nrr(r-1)$$


      2. The proposition trivially holds true for $n=0,1$







      share|cite|improve this answer





















      • Sorry, I do not really understand all of them. Can you explain it in detail? Thanks
        – Timgascd
        Dec 6 at 10:41










      • @Hgascd, All of them or none of them? $$binom nr=dfrac{n!}{(n-r)! r!}=dfrac{n(n-1)}{r(r-1)}cdotdfrac{(n-2)!}{(r-2)!cdot{n-2-(r-2)}!}=$$
        – lab bhattacharjee
        Dec 6 at 10:55












      • Thanks a lot. I got it
        – Timgascd
        Dec 6 at 11:04














      0












      0








      0






      Hint:



      For $r(r-1)ne0$



      $$r(r-1)binom nr=r(r-1)n(n-1)dfrac{(n-2)!}{r(r-1)cdot(r-2)!cdot{n-2-(r-2)}!}=n(n-1)binom{n-2}{r-2}$$



      Now in
      $$(a+b)^m=sum_{r=0}^mbinom mr a^{m-r}b^r$$



      put $a=b=1, m=n-2$



      Some observations :




      1. $$sum_{r=2}^nbinom nrr(r-1)=sum_{r=0}^nbinom nrr(r-1)$$


      2. The proposition trivially holds true for $n=0,1$







      share|cite|improve this answer












      Hint:



      For $r(r-1)ne0$



      $$r(r-1)binom nr=r(r-1)n(n-1)dfrac{(n-2)!}{r(r-1)cdot(r-2)!cdot{n-2-(r-2)}!}=n(n-1)binom{n-2}{r-2}$$



      Now in
      $$(a+b)^m=sum_{r=0}^mbinom mr a^{m-r}b^r$$



      put $a=b=1, m=n-2$



      Some observations :




      1. $$sum_{r=2}^nbinom nrr(r-1)=sum_{r=0}^nbinom nrr(r-1)$$


      2. The proposition trivially holds true for $n=0,1$








      share|cite|improve this answer












      share|cite|improve this answer



      share|cite|improve this answer










      answered Dec 6 at 10:20









      lab bhattacharjee

      222k15155273




      222k15155273












      • Sorry, I do not really understand all of them. Can you explain it in detail? Thanks
        – Timgascd
        Dec 6 at 10:41










      • @Hgascd, All of them or none of them? $$binom nr=dfrac{n!}{(n-r)! r!}=dfrac{n(n-1)}{r(r-1)}cdotdfrac{(n-2)!}{(r-2)!cdot{n-2-(r-2)}!}=$$
        – lab bhattacharjee
        Dec 6 at 10:55












      • Thanks a lot. I got it
        – Timgascd
        Dec 6 at 11:04


















      • Sorry, I do not really understand all of them. Can you explain it in detail? Thanks
        – Timgascd
        Dec 6 at 10:41










      • @Hgascd, All of them or none of them? $$binom nr=dfrac{n!}{(n-r)! r!}=dfrac{n(n-1)}{r(r-1)}cdotdfrac{(n-2)!}{(r-2)!cdot{n-2-(r-2)}!}=$$
        – lab bhattacharjee
        Dec 6 at 10:55












      • Thanks a lot. I got it
        – Timgascd
        Dec 6 at 11:04
















      Sorry, I do not really understand all of them. Can you explain it in detail? Thanks
      – Timgascd
      Dec 6 at 10:41




      Sorry, I do not really understand all of them. Can you explain it in detail? Thanks
      – Timgascd
      Dec 6 at 10:41












      @Hgascd, All of them or none of them? $$binom nr=dfrac{n!}{(n-r)! r!}=dfrac{n(n-1)}{r(r-1)}cdotdfrac{(n-2)!}{(r-2)!cdot{n-2-(r-2)}!}=$$
      – lab bhattacharjee
      Dec 6 at 10:55






      @Hgascd, All of them or none of them? $$binom nr=dfrac{n!}{(n-r)! r!}=dfrac{n(n-1)}{r(r-1)}cdotdfrac{(n-2)!}{(r-2)!cdot{n-2-(r-2)}!}=$$
      – lab bhattacharjee
      Dec 6 at 10:55














      Thanks a lot. I got it
      – Timgascd
      Dec 6 at 11:04




      Thanks a lot. I got it
      – Timgascd
      Dec 6 at 11:04











      1














      Question: On how many ways can we choose a group in a set of $n$ people and then president and then vicepresident?



      Well we can first a group of $r$ people, that is ${nchoose r}$, for every $rleq n$, and then president among them, so we have $r$ choises and then $r-1$ choises for V.P. Suming (we can sum from $0$) for all $r$ we get:



      $$sum_{r=0}^{n} r(r-1)C_{n}^{r} $$



      On the other hand we can first choose a president among all people, so we have $n$ posibilities and then V.P. for who we have $n-1$ choises and then we choose any set in set of $n-2$ people, for that we have $2^{n-2}$ choises, so:



      $$n(n-1)2^{n-2}$$ and this is the answer to your question.






      share|cite|improve this answer


























        1














        Question: On how many ways can we choose a group in a set of $n$ people and then president and then vicepresident?



        Well we can first a group of $r$ people, that is ${nchoose r}$, for every $rleq n$, and then president among them, so we have $r$ choises and then $r-1$ choises for V.P. Suming (we can sum from $0$) for all $r$ we get:



        $$sum_{r=0}^{n} r(r-1)C_{n}^{r} $$



        On the other hand we can first choose a president among all people, so we have $n$ posibilities and then V.P. for who we have $n-1$ choises and then we choose any set in set of $n-2$ people, for that we have $2^{n-2}$ choises, so:



        $$n(n-1)2^{n-2}$$ and this is the answer to your question.






        share|cite|improve this answer
























          1












          1








          1






          Question: On how many ways can we choose a group in a set of $n$ people and then president and then vicepresident?



          Well we can first a group of $r$ people, that is ${nchoose r}$, for every $rleq n$, and then president among them, so we have $r$ choises and then $r-1$ choises for V.P. Suming (we can sum from $0$) for all $r$ we get:



          $$sum_{r=0}^{n} r(r-1)C_{n}^{r} $$



          On the other hand we can first choose a president among all people, so we have $n$ posibilities and then V.P. for who we have $n-1$ choises and then we choose any set in set of $n-2$ people, for that we have $2^{n-2}$ choises, so:



          $$n(n-1)2^{n-2}$$ and this is the answer to your question.






          share|cite|improve this answer












          Question: On how many ways can we choose a group in a set of $n$ people and then president and then vicepresident?



          Well we can first a group of $r$ people, that is ${nchoose r}$, for every $rleq n$, and then president among them, so we have $r$ choises and then $r-1$ choises for V.P. Suming (we can sum from $0$) for all $r$ we get:



          $$sum_{r=0}^{n} r(r-1)C_{n}^{r} $$



          On the other hand we can first choose a president among all people, so we have $n$ posibilities and then V.P. for who we have $n-1$ choises and then we choose any set in set of $n-2$ people, for that we have $2^{n-2}$ choises, so:



          $$n(n-1)2^{n-2}$$ and this is the answer to your question.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Dec 6 at 10:20









          greedoid

          37.1k114794




          37.1k114794























              0














              Hint: Take $f(x)=(1+x)^n$ and consider $f''(1)$.






              share|cite|improve this answer


























                0














                Hint: Take $f(x)=(1+x)^n$ and consider $f''(1)$.






                share|cite|improve this answer
























                  0












                  0








                  0






                  Hint: Take $f(x)=(1+x)^n$ and consider $f''(1)$.






                  share|cite|improve this answer












                  Hint: Take $f(x)=(1+x)^n$ and consider $f''(1)$.







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered Dec 6 at 10:20









                  lhf

                  162k9166385




                  162k9166385






























                      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%2f3028304%2fprove-sum-r-2n-n-choose-r-rr-1-nn-12n-2-for-n-geq-2%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