Combination Problem Part 1 about Catalan Number











up vote
1
down vote

favorite












Refer to an election in which two candidates Wright and Upshaw ran for dogcatcher. After each vote was tabulated, Wright was never behind Upshaw. This problem is known as the ballot problem.



Suppose that each candidate received exactly $r$ votes. Show that the number of ways the votes could be counted is $C_r$, the $r-$th Catalan number.



My issue with this is, what's the relation between Combinations and the Catalan number? I do have the answer, but I don't understand the logic behind the counting argument.










share|cite|improve this question




























    up vote
    1
    down vote

    favorite












    Refer to an election in which two candidates Wright and Upshaw ran for dogcatcher. After each vote was tabulated, Wright was never behind Upshaw. This problem is known as the ballot problem.



    Suppose that each candidate received exactly $r$ votes. Show that the number of ways the votes could be counted is $C_r$, the $r-$th Catalan number.



    My issue with this is, what's the relation between Combinations and the Catalan number? I do have the answer, but I don't understand the logic behind the counting argument.










    share|cite|improve this question


























      up vote
      1
      down vote

      favorite









      up vote
      1
      down vote

      favorite











      Refer to an election in which two candidates Wright and Upshaw ran for dogcatcher. After each vote was tabulated, Wright was never behind Upshaw. This problem is known as the ballot problem.



      Suppose that each candidate received exactly $r$ votes. Show that the number of ways the votes could be counted is $C_r$, the $r-$th Catalan number.



      My issue with this is, what's the relation between Combinations and the Catalan number? I do have the answer, but I don't understand the logic behind the counting argument.










      share|cite|improve this question















      Refer to an election in which two candidates Wright and Upshaw ran for dogcatcher. After each vote was tabulated, Wright was never behind Upshaw. This problem is known as the ballot problem.



      Suppose that each candidate received exactly $r$ votes. Show that the number of ways the votes could be counted is $C_r$, the $r-$th Catalan number.



      My issue with this is, what's the relation between Combinations and the Catalan number? I do have the answer, but I don't understand the logic behind the counting argument.







      discrete-mathematics combinations catalan-numbers






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Nov 13 at 7:26









      AspiringMat

      478518




      478518










      asked Nov 13 at 7:02









      Aly J

      61




      61



























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


          }
          });














           

          draft saved


          draft discarded


















          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2996421%2fcombination-problem-part-1-about-catalan-number%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown






























          active

          oldest

          votes













          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes
















           

          draft saved


          draft discarded



















































           


          draft saved


          draft discarded














          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2996421%2fcombination-problem-part-1-about-catalan-number%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)

          ComboBox Display Member on multiple fields

          Is it possible to collect Nectar points via Trainline?