How to prove combinatorial $sum_{k=0}^{n/2} {nchoose2k} = sum_{k=0}^{n/2 - 1} {nchoose2k+1} = 2^{n-1}$












3












$begingroup$


I have problems solving the following formula for even positive integers $n$:



$$sum_{k=0}^{n/2} {nchoose 2k} = sum_{k=0}^{n/2 - 1} {nchoose 2k+1} = 2^{n-1}$$



I tried to prove it by induction but it didn't work. Is there any combinatorial proof?






combinatorics summation binomial-coefficients







share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    You can use the symmetry of the binomial coefficients to show the first equality. Then you can use the binomial theorem to show that the sum of the first two is equal to $2^n$ and conclude the second equality using the first one.
    $endgroup$
    – Severin Schraven
    Jan 24 at 11:15
















3












$begingroup$


I have problems solving the following formula for even positive integers $n$:



$$sum_{k=0}^{n/2} {nchoose 2k} = sum_{k=0}^{n/2 - 1} {nchoose 2k+1} = 2^{n-1}$$



I tried to prove it by induction but it didn't work. Is there any combinatorial proof?






combinatorics summation binomial-coefficients







share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    You can use the symmetry of the binomial coefficients to show the first equality. Then you can use the binomial theorem to show that the sum of the first two is equal to $2^n$ and conclude the second equality using the first one.
    $endgroup$
    – Severin Schraven
    Jan 24 at 11:15














3












3








3


1



$begingroup$


I have problems solving the following formula for even positive integers $n$:



$$sum_{k=0}^{n/2} {nchoose 2k} = sum_{k=0}^{n/2 - 1} {nchoose 2k+1} = 2^{n-1}$$



I tried to prove it by induction but it didn't work. Is there any combinatorial proof?






combinatorics summation binomial-coefficients







share|cite|improve this question











$endgroup$




I have problems solving the following formula for even positive integers $n$:



$$sum_{k=0}^{n/2} {nchoose 2k} = sum_{k=0}^{n/2 - 1} {nchoose 2k+1} = 2^{n-1}$$



I tried to prove it by induction but it didn't work. Is there any combinatorial proof?






combinatorics summation binomial-coefficients




combinatorics summation binomial-coefficients






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 28 at 2:26









darij grinberg

11.1k33167




11.1k33167










asked Jan 24 at 11:04









NickNick

191




191








  • 1




    $begingroup$
    You can use the symmetry of the binomial coefficients to show the first equality. Then you can use the binomial theorem to show that the sum of the first two is equal to $2^n$ and conclude the second equality using the first one.
    $endgroup$
    – Severin Schraven
    Jan 24 at 11:15














  • 1




    $begingroup$
    You can use the symmetry of the binomial coefficients to show the first equality. Then you can use the binomial theorem to show that the sum of the first two is equal to $2^n$ and conclude the second equality using the first one.
    $endgroup$
    – Severin Schraven
    Jan 24 at 11:15








1




1




$begingroup$
You can use the symmetry of the binomial coefficients to show the first equality. Then you can use the binomial theorem to show that the sum of the first two is equal to $2^n$ and conclude the second equality using the first one.
$endgroup$
– Severin Schraven
Jan 24 at 11:15




$begingroup$
You can use the symmetry of the binomial coefficients to show the first equality. Then you can use the binomial theorem to show that the sum of the first two is equal to $2^n$ and conclude the second equality using the first one.
$endgroup$
– Severin Schraven
Jan 24 at 11:15










3 Answers
3






active

oldest

votes


















3












$begingroup$

Let $S$ denote a set of size $nge 1$. Your first sum is the number of even-size subsets of $S$; the second sum counts the odd-size subsets instead. Fix some $ain S$, then pair each $xsubseteq Sbackslash{a}$ with $xcup{a}$. Since each pair is one odd-sized set and one even-sized set, there are equally many of each, and that's $2^{n-1}$.






share|cite|improve this answer









$endgroup$





















    2












    $begingroup$

    Hint:
    You can get the result by expanding these two expressions using the binomial theorem
    $$(1-1)^n=0 text{ and } (1+1)^n=2^n.$$






    share|cite|improve this answer









    $endgroup$





















      2












      $begingroup$

      For brevity we prove $$sum_{k=0}^{n} binom{2n}{2k} = sum_{k=0}^{n-1} binom{2n}{2k+1} = 2^{2n-1},hspace{2cm}(*)$$ for $ninmathbb{N}$. It is sufficient to show that $sum_{k=0}^{n} binom{2n}{2k}=2^{2n-1}$ since we have
      $$sum_{k=0}^{n} binom{2n}{2k} +sum_{k=0}^{n-1} binom{2n}{2k+1}=sum_{k=0}^{2n} binom{2n}{k} = 2^{2n}.hspace{2cm}(**)$$ Let apply induction for $sum_{k=0}^{n} binom{2n}{2k}=2^{2n-1}$.
      For $n=1$ equality is true. For $n=m$ assume equality is true, namely $sum_{k=0}^{m} binom{2m}{2k}=2^{2m-1}$(Here note that $sum_{k=0}^{m-1} binom{2m}{2k+1}=2^{2m-1}$ is also true by (**)). For $n=m+1$,
      begin{eqnarray*}sum_{k=0}^{m+1} binom{2m+2}{2k}&=&sum_{k=0}^{m+1}left{ binom{2m}{2k-1}+binom{2m}{2k-2}+binom{2m}{2k}+binom{2m}{2k-1}right}\
      &=&sum_{k=0}^{m+1} binom{2m}{2k}+ 2sum_{k=0}^{m+1} binom{2m}{2k-1}+sum_{k=0}^{m+1} binom{2m}{2k-2}\
      &=&sum_{k=0}^{m} binom{2m}{2k}+ 2sum_{k=0}^{m+1} binom{2m}{2k-1}+sum_{k=0}^{m+1} binom{2m}{2k-2}\
      &=&sum_{k=0}^{m} binom{2m}{2k}+2sum_{k=0}^{m-1} binom{2m}{2k+1}+sum_{k=0}^{m} binom{2m}{2k}\
      &=&4.2^{2m-1}=2^{2m+1}end{eqnarray*}       by use of $binom{n}{k}=binom{n-1}{k-1}+binom{n-1}{k}$. Hence equality $sum_{k=0}^{n} binom{2n}{2k}=2^{2n-1}$ is valid for $ninmathbb{N}$ which implies $(*)$.






      share|cite|improve this answer











      $endgroup$













      • $begingroup$
        Could you please explain the transformation in more detail from $sum_{k=0}^{n/2} {nchoose2k} = sum_{k=0}^{n/2 - 1} {nchoose2k+1} = 2^{n-1}$ to $sum_{k=0}^{n} {2nchoose2k} = sum_{k=0}^{n - 1} {2nchoose2k+1} = 2^{2n-1}$
        $endgroup$
        – Nick
        Jan 24 at 12:58










      • $begingroup$
        Since you take $n$ as even natural number in your question, we can make transformation $n=2m$ where $minmathbb{N}$. Then, your formula transforms accordingly.
        $endgroup$
        – guest
        Jan 24 at 13:41













      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%2f3085744%2fhow-to-prove-combinatorial-sum-k-0n-2-n-choose2k-sum-k-0n-2-1%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









      3












      $begingroup$

      Let $S$ denote a set of size $nge 1$. Your first sum is the number of even-size subsets of $S$; the second sum counts the odd-size subsets instead. Fix some $ain S$, then pair each $xsubseteq Sbackslash{a}$ with $xcup{a}$. Since each pair is one odd-sized set and one even-sized set, there are equally many of each, and that's $2^{n-1}$.






      share|cite|improve this answer









      $endgroup$


















        3












        $begingroup$

        Let $S$ denote a set of size $nge 1$. Your first sum is the number of even-size subsets of $S$; the second sum counts the odd-size subsets instead. Fix some $ain S$, then pair each $xsubseteq Sbackslash{a}$ with $xcup{a}$. Since each pair is one odd-sized set and one even-sized set, there are equally many of each, and that's $2^{n-1}$.






        share|cite|improve this answer









        $endgroup$
















          3












          3








          3





          $begingroup$

          Let $S$ denote a set of size $nge 1$. Your first sum is the number of even-size subsets of $S$; the second sum counts the odd-size subsets instead. Fix some $ain S$, then pair each $xsubseteq Sbackslash{a}$ with $xcup{a}$. Since each pair is one odd-sized set and one even-sized set, there are equally many of each, and that's $2^{n-1}$.






          share|cite|improve this answer









          $endgroup$



          Let $S$ denote a set of size $nge 1$. Your first sum is the number of even-size subsets of $S$; the second sum counts the odd-size subsets instead. Fix some $ain S$, then pair each $xsubseteq Sbackslash{a}$ with $xcup{a}$. Since each pair is one odd-sized set and one even-sized set, there are equally many of each, and that's $2^{n-1}$.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Jan 24 at 12:26









          J.G.J.G.

          28.9k22845




          28.9k22845























              2












              $begingroup$

              Hint:
              You can get the result by expanding these two expressions using the binomial theorem
              $$(1-1)^n=0 text{ and } (1+1)^n=2^n.$$






              share|cite|improve this answer









              $endgroup$


















                2












                $begingroup$

                Hint:
                You can get the result by expanding these two expressions using the binomial theorem
                $$(1-1)^n=0 text{ and } (1+1)^n=2^n.$$






                share|cite|improve this answer









                $endgroup$
















                  2












                  2








                  2





                  $begingroup$

                  Hint:
                  You can get the result by expanding these two expressions using the binomial theorem
                  $$(1-1)^n=0 text{ and } (1+1)^n=2^n.$$






                  share|cite|improve this answer









                  $endgroup$



                  Hint:
                  You can get the result by expanding these two expressions using the binomial theorem
                  $$(1-1)^n=0 text{ and } (1+1)^n=2^n.$$







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered Jan 24 at 12:31









                  Teddy38Teddy38

                  2,1912520




                  2,1912520























                      2












                      $begingroup$

                      For brevity we prove $$sum_{k=0}^{n} binom{2n}{2k} = sum_{k=0}^{n-1} binom{2n}{2k+1} = 2^{2n-1},hspace{2cm}(*)$$ for $ninmathbb{N}$. It is sufficient to show that $sum_{k=0}^{n} binom{2n}{2k}=2^{2n-1}$ since we have
                      $$sum_{k=0}^{n} binom{2n}{2k} +sum_{k=0}^{n-1} binom{2n}{2k+1}=sum_{k=0}^{2n} binom{2n}{k} = 2^{2n}.hspace{2cm}(**)$$ Let apply induction for $sum_{k=0}^{n} binom{2n}{2k}=2^{2n-1}$.
                      For $n=1$ equality is true. For $n=m$ assume equality is true, namely $sum_{k=0}^{m} binom{2m}{2k}=2^{2m-1}$(Here note that $sum_{k=0}^{m-1} binom{2m}{2k+1}=2^{2m-1}$ is also true by (**)). For $n=m+1$,
                      begin{eqnarray*}sum_{k=0}^{m+1} binom{2m+2}{2k}&=&sum_{k=0}^{m+1}left{ binom{2m}{2k-1}+binom{2m}{2k-2}+binom{2m}{2k}+binom{2m}{2k-1}right}\
                      &=&sum_{k=0}^{m+1} binom{2m}{2k}+ 2sum_{k=0}^{m+1} binom{2m}{2k-1}+sum_{k=0}^{m+1} binom{2m}{2k-2}\
                      &=&sum_{k=0}^{m} binom{2m}{2k}+ 2sum_{k=0}^{m+1} binom{2m}{2k-1}+sum_{k=0}^{m+1} binom{2m}{2k-2}\
                      &=&sum_{k=0}^{m} binom{2m}{2k}+2sum_{k=0}^{m-1} binom{2m}{2k+1}+sum_{k=0}^{m} binom{2m}{2k}\
                      &=&4.2^{2m-1}=2^{2m+1}end{eqnarray*}                       by use of $binom{n}{k}=binom{n-1}{k-1}+binom{n-1}{k}$. Hence equality $sum_{k=0}^{n} binom{2n}{2k}=2^{2n-1}$ is valid for $ninmathbb{N}$ which implies $(*)$.






                      share|cite|improve this answer











                      $endgroup$













                      • $begingroup$
                        Could you please explain the transformation in more detail from $sum_{k=0}^{n/2} {nchoose2k} = sum_{k=0}^{n/2 - 1} {nchoose2k+1} = 2^{n-1}$ to $sum_{k=0}^{n} {2nchoose2k} = sum_{k=0}^{n - 1} {2nchoose2k+1} = 2^{2n-1}$
                        $endgroup$
                        – Nick
                        Jan 24 at 12:58










                      • $begingroup$
                        Since you take $n$ as even natural number in your question, we can make transformation $n=2m$ where $minmathbb{N}$. Then, your formula transforms accordingly.
                        $endgroup$
                        – guest
                        Jan 24 at 13:41


















                      2












                      $begingroup$

                      For brevity we prove $$sum_{k=0}^{n} binom{2n}{2k} = sum_{k=0}^{n-1} binom{2n}{2k+1} = 2^{2n-1},hspace{2cm}(*)$$ for $ninmathbb{N}$. It is sufficient to show that $sum_{k=0}^{n} binom{2n}{2k}=2^{2n-1}$ since we have
                      $$sum_{k=0}^{n} binom{2n}{2k} +sum_{k=0}^{n-1} binom{2n}{2k+1}=sum_{k=0}^{2n} binom{2n}{k} = 2^{2n}.hspace{2cm}(**)$$ Let apply induction for $sum_{k=0}^{n} binom{2n}{2k}=2^{2n-1}$.
                      For $n=1$ equality is true. For $n=m$ assume equality is true, namely $sum_{k=0}^{m} binom{2m}{2k}=2^{2m-1}$(Here note that $sum_{k=0}^{m-1} binom{2m}{2k+1}=2^{2m-1}$ is also true by (**)). For $n=m+1$,
                      begin{eqnarray*}sum_{k=0}^{m+1} binom{2m+2}{2k}&=&sum_{k=0}^{m+1}left{ binom{2m}{2k-1}+binom{2m}{2k-2}+binom{2m}{2k}+binom{2m}{2k-1}right}\
                      &=&sum_{k=0}^{m+1} binom{2m}{2k}+ 2sum_{k=0}^{m+1} binom{2m}{2k-1}+sum_{k=0}^{m+1} binom{2m}{2k-2}\
                      &=&sum_{k=0}^{m} binom{2m}{2k}+ 2sum_{k=0}^{m+1} binom{2m}{2k-1}+sum_{k=0}^{m+1} binom{2m}{2k-2}\
                      &=&sum_{k=0}^{m} binom{2m}{2k}+2sum_{k=0}^{m-1} binom{2m}{2k+1}+sum_{k=0}^{m} binom{2m}{2k}\
                      &=&4.2^{2m-1}=2^{2m+1}end{eqnarray*}                       by use of $binom{n}{k}=binom{n-1}{k-1}+binom{n-1}{k}$. Hence equality $sum_{k=0}^{n} binom{2n}{2k}=2^{2n-1}$ is valid for $ninmathbb{N}$ which implies $(*)$.






                      share|cite|improve this answer











                      $endgroup$













                      • $begingroup$
                        Could you please explain the transformation in more detail from $sum_{k=0}^{n/2} {nchoose2k} = sum_{k=0}^{n/2 - 1} {nchoose2k+1} = 2^{n-1}$ to $sum_{k=0}^{n} {2nchoose2k} = sum_{k=0}^{n - 1} {2nchoose2k+1} = 2^{2n-1}$
                        $endgroup$
                        – Nick
                        Jan 24 at 12:58










                      • $begingroup$
                        Since you take $n$ as even natural number in your question, we can make transformation $n=2m$ where $minmathbb{N}$. Then, your formula transforms accordingly.
                        $endgroup$
                        – guest
                        Jan 24 at 13:41
















                      2












                      2








                      2





                      $begingroup$

                      For brevity we prove $$sum_{k=0}^{n} binom{2n}{2k} = sum_{k=0}^{n-1} binom{2n}{2k+1} = 2^{2n-1},hspace{2cm}(*)$$ for $ninmathbb{N}$. It is sufficient to show that $sum_{k=0}^{n} binom{2n}{2k}=2^{2n-1}$ since we have
                      $$sum_{k=0}^{n} binom{2n}{2k} +sum_{k=0}^{n-1} binom{2n}{2k+1}=sum_{k=0}^{2n} binom{2n}{k} = 2^{2n}.hspace{2cm}(**)$$ Let apply induction for $sum_{k=0}^{n} binom{2n}{2k}=2^{2n-1}$.
                      For $n=1$ equality is true. For $n=m$ assume equality is true, namely $sum_{k=0}^{m} binom{2m}{2k}=2^{2m-1}$(Here note that $sum_{k=0}^{m-1} binom{2m}{2k+1}=2^{2m-1}$ is also true by (**)). For $n=m+1$,
                      begin{eqnarray*}sum_{k=0}^{m+1} binom{2m+2}{2k}&=&sum_{k=0}^{m+1}left{ binom{2m}{2k-1}+binom{2m}{2k-2}+binom{2m}{2k}+binom{2m}{2k-1}right}\
                      &=&sum_{k=0}^{m+1} binom{2m}{2k}+ 2sum_{k=0}^{m+1} binom{2m}{2k-1}+sum_{k=0}^{m+1} binom{2m}{2k-2}\
                      &=&sum_{k=0}^{m} binom{2m}{2k}+ 2sum_{k=0}^{m+1} binom{2m}{2k-1}+sum_{k=0}^{m+1} binom{2m}{2k-2}\
                      &=&sum_{k=0}^{m} binom{2m}{2k}+2sum_{k=0}^{m-1} binom{2m}{2k+1}+sum_{k=0}^{m} binom{2m}{2k}\
                      &=&4.2^{2m-1}=2^{2m+1}end{eqnarray*}                       by use of $binom{n}{k}=binom{n-1}{k-1}+binom{n-1}{k}$. Hence equality $sum_{k=0}^{n} binom{2n}{2k}=2^{2n-1}$ is valid for $ninmathbb{N}$ which implies $(*)$.






                      share|cite|improve this answer











                      $endgroup$



                      For brevity we prove $$sum_{k=0}^{n} binom{2n}{2k} = sum_{k=0}^{n-1} binom{2n}{2k+1} = 2^{2n-1},hspace{2cm}(*)$$ for $ninmathbb{N}$. It is sufficient to show that $sum_{k=0}^{n} binom{2n}{2k}=2^{2n-1}$ since we have
                      $$sum_{k=0}^{n} binom{2n}{2k} +sum_{k=0}^{n-1} binom{2n}{2k+1}=sum_{k=0}^{2n} binom{2n}{k} = 2^{2n}.hspace{2cm}(**)$$ Let apply induction for $sum_{k=0}^{n} binom{2n}{2k}=2^{2n-1}$.
                      For $n=1$ equality is true. For $n=m$ assume equality is true, namely $sum_{k=0}^{m} binom{2m}{2k}=2^{2m-1}$(Here note that $sum_{k=0}^{m-1} binom{2m}{2k+1}=2^{2m-1}$ is also true by (**)). For $n=m+1$,
                      begin{eqnarray*}sum_{k=0}^{m+1} binom{2m+2}{2k}&=&sum_{k=0}^{m+1}left{ binom{2m}{2k-1}+binom{2m}{2k-2}+binom{2m}{2k}+binom{2m}{2k-1}right}\
                      &=&sum_{k=0}^{m+1} binom{2m}{2k}+ 2sum_{k=0}^{m+1} binom{2m}{2k-1}+sum_{k=0}^{m+1} binom{2m}{2k-2}\
                      &=&sum_{k=0}^{m} binom{2m}{2k}+ 2sum_{k=0}^{m+1} binom{2m}{2k-1}+sum_{k=0}^{m+1} binom{2m}{2k-2}\
                      &=&sum_{k=0}^{m} binom{2m}{2k}+2sum_{k=0}^{m-1} binom{2m}{2k+1}+sum_{k=0}^{m} binom{2m}{2k}\
                      &=&4.2^{2m-1}=2^{2m+1}end{eqnarray*}                       by use of $binom{n}{k}=binom{n-1}{k-1}+binom{n-1}{k}$. Hence equality $sum_{k=0}^{n} binom{2n}{2k}=2^{2n-1}$ is valid for $ninmathbb{N}$ which implies $(*)$.







                      share|cite|improve this answer














                      share|cite|improve this answer



                      share|cite|improve this answer








                      edited Jan 24 at 13:36

























                      answered Jan 24 at 12:14









                      guestguest

                      775416




                      775416












                      • $begingroup$
                        Could you please explain the transformation in more detail from $sum_{k=0}^{n/2} {nchoose2k} = sum_{k=0}^{n/2 - 1} {nchoose2k+1} = 2^{n-1}$ to $sum_{k=0}^{n} {2nchoose2k} = sum_{k=0}^{n - 1} {2nchoose2k+1} = 2^{2n-1}$
                        $endgroup$
                        – Nick
                        Jan 24 at 12:58










                      • $begingroup$
                        Since you take $n$ as even natural number in your question, we can make transformation $n=2m$ where $minmathbb{N}$. Then, your formula transforms accordingly.
                        $endgroup$
                        – guest
                        Jan 24 at 13:41




















                      • $begingroup$
                        Could you please explain the transformation in more detail from $sum_{k=0}^{n/2} {nchoose2k} = sum_{k=0}^{n/2 - 1} {nchoose2k+1} = 2^{n-1}$ to $sum_{k=0}^{n} {2nchoose2k} = sum_{k=0}^{n - 1} {2nchoose2k+1} = 2^{2n-1}$
                        $endgroup$
                        – Nick
                        Jan 24 at 12:58










                      • $begingroup$
                        Since you take $n$ as even natural number in your question, we can make transformation $n=2m$ where $minmathbb{N}$. Then, your formula transforms accordingly.
                        $endgroup$
                        – guest
                        Jan 24 at 13:41


















                      $begingroup$
                      Could you please explain the transformation in more detail from $sum_{k=0}^{n/2} {nchoose2k} = sum_{k=0}^{n/2 - 1} {nchoose2k+1} = 2^{n-1}$ to $sum_{k=0}^{n} {2nchoose2k} = sum_{k=0}^{n - 1} {2nchoose2k+1} = 2^{2n-1}$
                      $endgroup$
                      – Nick
                      Jan 24 at 12:58




                      $begingroup$
                      Could you please explain the transformation in more detail from $sum_{k=0}^{n/2} {nchoose2k} = sum_{k=0}^{n/2 - 1} {nchoose2k+1} = 2^{n-1}$ to $sum_{k=0}^{n} {2nchoose2k} = sum_{k=0}^{n - 1} {2nchoose2k+1} = 2^{2n-1}$
                      $endgroup$
                      – Nick
                      Jan 24 at 12:58












                      $begingroup$
                      Since you take $n$ as even natural number in your question, we can make transformation $n=2m$ where $minmathbb{N}$. Then, your formula transforms accordingly.
                      $endgroup$
                      – guest
                      Jan 24 at 13:41






                      $begingroup$
                      Since you take $n$ as even natural number in your question, we can make transformation $n=2m$ where $minmathbb{N}$. Then, your formula transforms accordingly.
                      $endgroup$
                      – guest
                      Jan 24 at 13:41




















                      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%2f3085744%2fhow-to-prove-combinatorial-sum-k-0n-2-n-choose2k-sum-k-0n-2-1%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

                      Mario Kart Wii

                      Image
                      Please consider supporting The Cutting Room Floor on Patreon. Thanks for all your support! Mario Kart Wii From The Cutting Room Floor Jump to: navigation, search Mario Kart Wii Developer : Nintendo Publisher : Nintendo Platform : Wii Released in JP : April 10, 2008 Released in US : April 27, 2008 Released in EU : April 11, 2008 Released in AU : April 24, 2008 Released in KR : April 30, 2009 This game has unused animations. This game has unused areas. This game has unused code. This game has unused objects. This game has unused modes / minigames. This game has unused graphics. This game has unused models. This game has unused items. This game has unused music. This game has regional differences. This game has a notes page This game has a prerelease article Mario Kart Wii is the sixth game in the series (not counting Arcade editions), which intro...
                      Read more

                      The Binding of Isaac: Rebirth/Afterbirth

                      Image
                      Please consider supporting The Cutting Room Floor on Patreon. Thanks for all your support! The Binding of Isaac: Rebirth/Afterbirth From The Cutting Room Floor < The Binding of Isaac: Rebirth Jump to: navigation, search This is a sub-page of The Binding of Isaac: Rebirth . Afterbirth is the first expansion pack for Rebirth and features a variety of improvements. Contents 1 Unused Graphics 1.1 Old Man Keeper 1.2 Skinless Hush 1.3 Miscellaneous Unused Hush Sprites 1.4 Generosity achievement 1.5 Afterbirth+ Room Editor 1.6 Bearded Ultra Greed 1.7 Early Ultra Greed 1.8 Unused Brownie Expression 1.9 Frail's Spinning Head 1.10 Mom's Dead Hand Alt 2 Unused Audio 2.1 Unused Dead Womb Layer 2.2 Unused Hush Battle Outro 2.3 The Stain Grunt Unused Graphics Old Man Keeper Image file: gfxuimain me...
                      Read more

                      What does “Dominus providebit” mean?

                      Image
                      5 Does "Dominus providebit" mean "The Lord will provide" or "The Lord provides"? I once had a bit of an argument with a guy who studied Latin over that. It's an inscription that appears on the rim of some old Swiss coins that I have. meaning latin-to-english-translation grammar-identification share | improve this question edited Jan 18 at 15:27 V2Blast 105 4 asked Jan 17 at 22:49 Donald K. Donald K. 26 1 ...
                      Read more