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

                      How to change which sound is reproduced for terminal bell?

                      Image
                      3 Recently upgrade to 18.10 from 18.04, and using the terminal is becoming annoying: the new alert sound is a drip ( /usr/share/sounds/gnome/default/alerts/drip.ogg ), and the previous one is still located at ( /usr/share/sounds/ubuntu/stereo/bell.ogg ). My issue is that at the gnome-terminal, when autocompleting or pressing left BOTH sounds are reproduced, at the same time. I want to just have ubuntu/stereo/bell.ogg active, not both . At the moment I have been only able to reduce the volume of the alerts (but still both are played), or turn the alerts down (but I dislike both "solutions"). gnome-terminal 18.10 teminal-bell share | improve this question
                      Read more

                      Title Spacing in Bjornstrup Chapter, Removing Chapter Number From Contents

                      Image
                      up vote 5 down vote favorite 2 I would like to make it so that the vertical space below the title of each chapter is the same when using the Bjornstrup package (i.e. so that the descenders do not affect the spacing - as shown by the red arrow in the picture below). I think I'm fairly happy with the spacing around "A chapter", so I'd really like titles without descenders (e.g. "Contents") to have the same vertical spacing as "A chapter" below the title. I would also like to remove the large "0" in the contents title. Any help appreciated, as always. documentclass[11pt,a4paper]{book} % Packages[![enter image description here][1]][1] usepackage[left=3.5cm, right=3.5cm, top=4.3cm, bottom=4.25cm]{geometry} usepackage[utf8]{inputenc} usepackage{libertine} usepackage[libertine]{newtx
                      Read more

                      Can I use Tabulator js library in my java Spring + Thymeleaf project?

                      Image
                      0 I want to add Tabulator js to my java project. I added tabulator.min.js, tabulator.min.css to resources folder. After that added to my html page these dependencies as recommending in readme.md. <link rel="stylesheet" th:href="@{/css/tabulator.min.css}"> <script type="text/javascript" th:src="@{/js/tabulator.min.js}"></script> Now my tables view all elements, that I have in the html page, but not correct. In the documentation of Tabulator is example how to create header and table, var table = new Tabulator("#example-table", { columns:[ {title:"Name", field:"name", sorter:"string", width:200, editor:true}, {title:"Age", field:"age", sorter:"
                      Read more