Number of ways to pick an equal number of elements from two sets?











up vote
2
down vote

favorite













There are two groups such that one group contains $m$ elements and another group contains $n$ elements. We have to find number of ways to pick same number of elements from both the groups.




My approach is
$1+dbinom m1.dbinom n1+dbinom m2 . dbinom n2 +.... $upto $dbinom mm$ or $dbinom nn$ whatever is smaller.

Is there any faster way to do the same?



Example:
$3$ and $2$
$1+dbinom 31.dbinom 21+dbinom 32 . dbinom 22=10$ ways










share|cite|improve this question









New contributor




Sagar Sharma is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
























    up vote
    2
    down vote

    favorite













    There are two groups such that one group contains $m$ elements and another group contains $n$ elements. We have to find number of ways to pick same number of elements from both the groups.




    My approach is
    $1+dbinom m1.dbinom n1+dbinom m2 . dbinom n2 +.... $upto $dbinom mm$ or $dbinom nn$ whatever is smaller.

    Is there any faster way to do the same?



    Example:
    $3$ and $2$
    $1+dbinom 31.dbinom 21+dbinom 32 . dbinom 22=10$ ways










    share|cite|improve this question









    New contributor




    Sagar Sharma is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
    Check out our Code of Conduct.






















      up vote
      2
      down vote

      favorite









      up vote
      2
      down vote

      favorite












      There are two groups such that one group contains $m$ elements and another group contains $n$ elements. We have to find number of ways to pick same number of elements from both the groups.




      My approach is
      $1+dbinom m1.dbinom n1+dbinom m2 . dbinom n2 +.... $upto $dbinom mm$ or $dbinom nn$ whatever is smaller.

      Is there any faster way to do the same?



      Example:
      $3$ and $2$
      $1+dbinom 31.dbinom 21+dbinom 32 . dbinom 22=10$ ways










      share|cite|improve this question









      New contributor




      Sagar Sharma is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.












      There are two groups such that one group contains $m$ elements and another group contains $n$ elements. We have to find number of ways to pick same number of elements from both the groups.




      My approach is
      $1+dbinom m1.dbinom n1+dbinom m2 . dbinom n2 +.... $upto $dbinom mm$ or $dbinom nn$ whatever is smaller.

      Is there any faster way to do the same?



      Example:
      $3$ and $2$
      $1+dbinom 31.dbinom 21+dbinom 32 . dbinom 22=10$ ways







      combinatorics permutations






      share|cite|improve this question









      New contributor




      Sagar Sharma is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.











      share|cite|improve this question









      New contributor




      Sagar Sharma is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.









      share|cite|improve this question




      share|cite|improve this question








      edited yesterday









      SmarthBansal

      36412




      36412






      New contributor




      Sagar Sharma is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.









      asked yesterday









      Sagar Sharma

      161




      161




      New contributor




      Sagar Sharma is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.





      New contributor





      Sagar Sharma is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.






      Sagar Sharma is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.



























          active

          oldest

          votes











          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',
          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
          });


          }
          });






          Sagar Sharma is a new contributor. Be nice, and check out our Code of Conduct.










           

          draft saved


          draft discarded


















          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3004976%2fnumber-of-ways-to-pick-an-equal-number-of-elements-from-two-sets%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown






























          active

          oldest

          votes













          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes








          Sagar Sharma is a new contributor. Be nice, and check out our Code of Conduct.










           

          draft saved


          draft discarded


















          Sagar Sharma is a new contributor. Be nice, and check out our Code of Conduct.













          Sagar Sharma is a new contributor. Be nice, and check out our Code of Conduct.












          Sagar Sharma is a new contributor. Be nice, and check out our Code of Conduct.















           


          draft saved


          draft discarded














          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3004976%2fnumber-of-ways-to-pick-an-equal-number-of-elements-from-two-sets%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

          'app-layout' is not a known element: how to share Component with different Modules

          android studio warns about leanback feature tag usage required on manifest while using Unity exported app?

          WPF add header to Image with URL pettitions [duplicate]