Combinatorics Proof?












3












$begingroup$


How would I prove
$$sum_{b=0}^a frac{(2a)!}{b!b!(a-b)!(a-b)!} = binom{2a}{a}binom{2a}{a}$$



I am familiar with the identity $$binom{2n}{n}=sum_{k=0}^nbinom{n}{k}binom{n}{n-k}=binom{n}{k}^2$$ Would I be able to use this?






combinatorics proof-verification







share|cite|improve this question











$endgroup$












  • $begingroup$
    I would say yes. Very much so.
    $endgroup$
    – Somos
    Dec 11 '18 at 17:04










  • $begingroup$
    and in the last identity, you lost the Sum
    $endgroup$
    – G Cab
    Dec 11 '18 at 17:45
















3












$begingroup$


How would I prove
$$sum_{b=0}^a frac{(2a)!}{b!b!(a-b)!(a-b)!} = binom{2a}{a}binom{2a}{a}$$



I am familiar with the identity $$binom{2n}{n}=sum_{k=0}^nbinom{n}{k}binom{n}{n-k}=binom{n}{k}^2$$ Would I be able to use this?






combinatorics proof-verification







share|cite|improve this question











$endgroup$












  • $begingroup$
    I would say yes. Very much so.
    $endgroup$
    – Somos
    Dec 11 '18 at 17:04










  • $begingroup$
    and in the last identity, you lost the Sum
    $endgroup$
    – G Cab
    Dec 11 '18 at 17:45














3












3








3


2



$begingroup$


How would I prove
$$sum_{b=0}^a frac{(2a)!}{b!b!(a-b)!(a-b)!} = binom{2a}{a}binom{2a}{a}$$



I am familiar with the identity $$binom{2n}{n}=sum_{k=0}^nbinom{n}{k}binom{n}{n-k}=binom{n}{k}^2$$ Would I be able to use this?






combinatorics proof-verification







share|cite|improve this question











$endgroup$




How would I prove
$$sum_{b=0}^a frac{(2a)!}{b!b!(a-b)!(a-b)!} = binom{2a}{a}binom{2a}{a}$$



I am familiar with the identity $$binom{2n}{n}=sum_{k=0}^nbinom{n}{k}binom{n}{n-k}=binom{n}{k}^2$$ Would I be able to use this?






combinatorics proof-verification




combinatorics proof-verification






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 11 '18 at 22:18

























asked Dec 11 '18 at 16:52







user497933



















  • $begingroup$
    I would say yes. Very much so.
    $endgroup$
    – Somos
    Dec 11 '18 at 17:04










  • $begingroup$
    and in the last identity, you lost the Sum
    $endgroup$
    – G Cab
    Dec 11 '18 at 17:45


















  • $begingroup$
    I would say yes. Very much so.
    $endgroup$
    – Somos
    Dec 11 '18 at 17:04










  • $begingroup$
    and in the last identity, you lost the Sum
    $endgroup$
    – G Cab
    Dec 11 '18 at 17:45
















$begingroup$
I would say yes. Very much so.
$endgroup$
– Somos
Dec 11 '18 at 17:04




$begingroup$
I would say yes. Very much so.
$endgroup$
– Somos
Dec 11 '18 at 17:04












$begingroup$
and in the last identity, you lost the Sum
$endgroup$
– G Cab
Dec 11 '18 at 17:45




$begingroup$
and in the last identity, you lost the Sum
$endgroup$
– G Cab
Dec 11 '18 at 17:45










2 Answers
2






active

oldest

votes


















6












$begingroup$

This is not purely bijective proof. The identity that you said you knew of it can be proved bijectively. We will use that fact to prove the new identity.



First rewrite
begin{align}
frac{(2a)!}{b!b!(a-b)!(a-b)!} &= frac{(2a)!}{a!a!}frac{a!a!}{b!(b-a)!b!(b-a)!}\
&={2a choose a}
{achoose b}{a choose b-a}end{align}
It follows that
begin{align}
sum_{b=0}^a frac{(2a)!}{b!b!(a-b)!(a-b)!} &={2a choose a}sum_{b=0}^a {achoose b}{achoose a-b}\
&={2achoose a}{2achoose a}quad text{(by your identity)}
end{align}






share|cite|improve this answer









$endgroup$





















    2












    $begingroup$

    The summand $frac{(2a)!}{(b!)^2((a-b)!)^2}$ counts the number of ways to color the elements of a set $S$ of size $2a$ in four colors, so that there are $b$ elements in the first two colors and $a-b$ elements in the last two colors.



    The right hand side counts the number of ways to choose two subsets $A$ and $B$ of $S$ of size $a$. This induces a coloring in the following way:





    • $xin A, xin Bimplies x$ is red.


    • $xin A, xnotin Bimplies x$ is blue.


    • $xnotin A, xin Bimplies x$ is green.


    • $xnotin A, xnotin Bimplies x$ is black.


    Combining these two pieces, you can make a combinatorial proof.






    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%2f3035499%2fcombinatorics-proof%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









      6












      $begingroup$

      This is not purely bijective proof. The identity that you said you knew of it can be proved bijectively. We will use that fact to prove the new identity.



      First rewrite
      begin{align}
      frac{(2a)!}{b!b!(a-b)!(a-b)!} &= frac{(2a)!}{a!a!}frac{a!a!}{b!(b-a)!b!(b-a)!}\
      &={2a choose a}
      {achoose b}{a choose b-a}end{align}
      It follows that
      begin{align}
      sum_{b=0}^a frac{(2a)!}{b!b!(a-b)!(a-b)!} &={2a choose a}sum_{b=0}^a {achoose b}{achoose a-b}\
      &={2achoose a}{2achoose a}quad text{(by your identity)}
      end{align}






      share|cite|improve this answer









      $endgroup$


















        6












        $begingroup$

        This is not purely bijective proof. The identity that you said you knew of it can be proved bijectively. We will use that fact to prove the new identity.



        First rewrite
        begin{align}
        frac{(2a)!}{b!b!(a-b)!(a-b)!} &= frac{(2a)!}{a!a!}frac{a!a!}{b!(b-a)!b!(b-a)!}\
        &={2a choose a}
        {achoose b}{a choose b-a}end{align}
        It follows that
        begin{align}
        sum_{b=0}^a frac{(2a)!}{b!b!(a-b)!(a-b)!} &={2a choose a}sum_{b=0}^a {achoose b}{achoose a-b}\
        &={2achoose a}{2achoose a}quad text{(by your identity)}
        end{align}






        share|cite|improve this answer









        $endgroup$
















          6












          6








          6





          $begingroup$

          This is not purely bijective proof. The identity that you said you knew of it can be proved bijectively. We will use that fact to prove the new identity.



          First rewrite
          begin{align}
          frac{(2a)!}{b!b!(a-b)!(a-b)!} &= frac{(2a)!}{a!a!}frac{a!a!}{b!(b-a)!b!(b-a)!}\
          &={2a choose a}
          {achoose b}{a choose b-a}end{align}
          It follows that
          begin{align}
          sum_{b=0}^a frac{(2a)!}{b!b!(a-b)!(a-b)!} &={2a choose a}sum_{b=0}^a {achoose b}{achoose a-b}\
          &={2achoose a}{2achoose a}quad text{(by your identity)}
          end{align}






          share|cite|improve this answer









          $endgroup$



          This is not purely bijective proof. The identity that you said you knew of it can be proved bijectively. We will use that fact to prove the new identity.



          First rewrite
          begin{align}
          frac{(2a)!}{b!b!(a-b)!(a-b)!} &= frac{(2a)!}{a!a!}frac{a!a!}{b!(b-a)!b!(b-a)!}\
          &={2a choose a}
          {achoose b}{a choose b-a}end{align}
          It follows that
          begin{align}
          sum_{b=0}^a frac{(2a)!}{b!b!(a-b)!(a-b)!} &={2a choose a}sum_{b=0}^a {achoose b}{achoose a-b}\
          &={2achoose a}{2achoose a}quad text{(by your identity)}
          end{align}







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Dec 11 '18 at 17:21









          user9077user9077

          1,249612




          1,249612























              2












              $begingroup$

              The summand $frac{(2a)!}{(b!)^2((a-b)!)^2}$ counts the number of ways to color the elements of a set $S$ of size $2a$ in four colors, so that there are $b$ elements in the first two colors and $a-b$ elements in the last two colors.



              The right hand side counts the number of ways to choose two subsets $A$ and $B$ of $S$ of size $a$. This induces a coloring in the following way:





              • $xin A, xin Bimplies x$ is red.


              • $xin A, xnotin Bimplies x$ is blue.


              • $xnotin A, xin Bimplies x$ is green.


              • $xnotin A, xnotin Bimplies x$ is black.


              Combining these two pieces, you can make a combinatorial proof.






              share|cite|improve this answer









              $endgroup$


















                2












                $begingroup$

                The summand $frac{(2a)!}{(b!)^2((a-b)!)^2}$ counts the number of ways to color the elements of a set $S$ of size $2a$ in four colors, so that there are $b$ elements in the first two colors and $a-b$ elements in the last two colors.



                The right hand side counts the number of ways to choose two subsets $A$ and $B$ of $S$ of size $a$. This induces a coloring in the following way:





                • $xin A, xin Bimplies x$ is red.


                • $xin A, xnotin Bimplies x$ is blue.


                • $xnotin A, xin Bimplies x$ is green.


                • $xnotin A, xnotin Bimplies x$ is black.


                Combining these two pieces, you can make a combinatorial proof.






                share|cite|improve this answer









                $endgroup$
















                  2












                  2








                  2





                  $begingroup$

                  The summand $frac{(2a)!}{(b!)^2((a-b)!)^2}$ counts the number of ways to color the elements of a set $S$ of size $2a$ in four colors, so that there are $b$ elements in the first two colors and $a-b$ elements in the last two colors.



                  The right hand side counts the number of ways to choose two subsets $A$ and $B$ of $S$ of size $a$. This induces a coloring in the following way:





                  • $xin A, xin Bimplies x$ is red.


                  • $xin A, xnotin Bimplies x$ is blue.


                  • $xnotin A, xin Bimplies x$ is green.


                  • $xnotin A, xnotin Bimplies x$ is black.


                  Combining these two pieces, you can make a combinatorial proof.






                  share|cite|improve this answer









                  $endgroup$



                  The summand $frac{(2a)!}{(b!)^2((a-b)!)^2}$ counts the number of ways to color the elements of a set $S$ of size $2a$ in four colors, so that there are $b$ elements in the first two colors and $a-b$ elements in the last two colors.



                  The right hand side counts the number of ways to choose two subsets $A$ and $B$ of $S$ of size $a$. This induces a coloring in the following way:





                  • $xin A, xin Bimplies x$ is red.


                  • $xin A, xnotin Bimplies x$ is blue.


                  • $xnotin A, xin Bimplies x$ is green.


                  • $xnotin A, xnotin Bimplies x$ is black.


                  Combining these two pieces, you can make a combinatorial proof.







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered Dec 11 '18 at 17:57









                  Mike EarnestMike Earnest

                  26.5k22151




                  26.5k22151






























                      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%2f3035499%2fcombinatorics-proof%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