What is the intuition behind the resolution method for this problem?











up vote
0
down vote

favorite












I'm trying to understand the intuition behind the way we proceed to calculate how many different 4-digit numbers can we build using digits from $1$ to $9$, such that there is exactly one digit repeated, so for example $1982$ or $6333$ are not valid, but $2942$ and $7721$ are. To find the result, we calculate



$$9cdot text{C}^4_2 cdot text{P}^8_2 = 9binom{4}{2} cdot frac{8!}{6!} = 3024$$



Now when I look at $text{C}^4_2$ I can't think in other terms than "amount of possible subsets of size 2 that we can build from a set of 4 elements", so I really can't get the intuition of multiplying this by "the amount of different size-2 permutations we can create from a set of eight elements, without repetition". I would appreciate someone explains to me the logic of this operation, because I don't like to do mathematics mechanically and without understanding what I'm doing. Thank you.










share|cite|improve this question


























    up vote
    0
    down vote

    favorite












    I'm trying to understand the intuition behind the way we proceed to calculate how many different 4-digit numbers can we build using digits from $1$ to $9$, such that there is exactly one digit repeated, so for example $1982$ or $6333$ are not valid, but $2942$ and $7721$ are. To find the result, we calculate



    $$9cdot text{C}^4_2 cdot text{P}^8_2 = 9binom{4}{2} cdot frac{8!}{6!} = 3024$$



    Now when I look at $text{C}^4_2$ I can't think in other terms than "amount of possible subsets of size 2 that we can build from a set of 4 elements", so I really can't get the intuition of multiplying this by "the amount of different size-2 permutations we can create from a set of eight elements, without repetition". I would appreciate someone explains to me the logic of this operation, because I don't like to do mathematics mechanically and without understanding what I'm doing. Thank you.










    share|cite|improve this question
























      up vote
      0
      down vote

      favorite









      up vote
      0
      down vote

      favorite











      I'm trying to understand the intuition behind the way we proceed to calculate how many different 4-digit numbers can we build using digits from $1$ to $9$, such that there is exactly one digit repeated, so for example $1982$ or $6333$ are not valid, but $2942$ and $7721$ are. To find the result, we calculate



      $$9cdot text{C}^4_2 cdot text{P}^8_2 = 9binom{4}{2} cdot frac{8!}{6!} = 3024$$



      Now when I look at $text{C}^4_2$ I can't think in other terms than "amount of possible subsets of size 2 that we can build from a set of 4 elements", so I really can't get the intuition of multiplying this by "the amount of different size-2 permutations we can create from a set of eight elements, without repetition". I would appreciate someone explains to me the logic of this operation, because I don't like to do mathematics mechanically and without understanding what I'm doing. Thank you.










      share|cite|improve this question













      I'm trying to understand the intuition behind the way we proceed to calculate how many different 4-digit numbers can we build using digits from $1$ to $9$, such that there is exactly one digit repeated, so for example $1982$ or $6333$ are not valid, but $2942$ and $7721$ are. To find the result, we calculate



      $$9cdot text{C}^4_2 cdot text{P}^8_2 = 9binom{4}{2} cdot frac{8!}{6!} = 3024$$



      Now when I look at $text{C}^4_2$ I can't think in other terms than "amount of possible subsets of size 2 that we can build from a set of 4 elements", so I really can't get the intuition of multiplying this by "the amount of different size-2 permutations we can create from a set of eight elements, without repetition". I would appreciate someone explains to me the logic of this operation, because I don't like to do mathematics mechanically and without understanding what I'm doing. Thank you.







      combinatorics statistics permutations combinations






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Nov 26 at 10:17









      torito verdejo

      725




      725






















          1 Answer
          1






          active

          oldest

          votes

















          up vote
          2
          down vote



          accepted











          • Choose 1 digit out of $1, ldots, 9$: $color{blue}{9}$ possibilities

          • Choose $2$ places out of $4$ to place this digit twice: $color{blue}{binom{4}{2}}$ possibilities

          • Fill the remaining $2$ places with $2$ different digits from the remaining $8$ digits: $color{blue}{8cdot 7 = P_2^8}$ possibilities


          All together
          $$color{blue}{9cdot binom{4}{2} cdot 8 cdot 7}$$






          share|cite|improve this answer





















          • Oh, now I get it, and I also get why we are multiplying everything : we do so to take into account every possible position of the two other digits, for each of the possible positions where the repeated digit can be placed, right? Thank you.
            – torito verdejo
            Nov 26 at 10:31










          • Exactly. Basis for the multiplication here is the so called "multiplication principle" (en.wikipedia.org/wiki/Rule_of_product ) as a basic counting rule in combinatorics.
            – trancelocation
            Nov 26 at 10:35











          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%2f3014147%2fwhat-is-the-intuition-behind-the-resolution-method-for-this-problem%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown

























          1 Answer
          1






          active

          oldest

          votes








          1 Answer
          1






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes








          up vote
          2
          down vote



          accepted











          • Choose 1 digit out of $1, ldots, 9$: $color{blue}{9}$ possibilities

          • Choose $2$ places out of $4$ to place this digit twice: $color{blue}{binom{4}{2}}$ possibilities

          • Fill the remaining $2$ places with $2$ different digits from the remaining $8$ digits: $color{blue}{8cdot 7 = P_2^8}$ possibilities


          All together
          $$color{blue}{9cdot binom{4}{2} cdot 8 cdot 7}$$






          share|cite|improve this answer





















          • Oh, now I get it, and I also get why we are multiplying everything : we do so to take into account every possible position of the two other digits, for each of the possible positions where the repeated digit can be placed, right? Thank you.
            – torito verdejo
            Nov 26 at 10:31










          • Exactly. Basis for the multiplication here is the so called "multiplication principle" (en.wikipedia.org/wiki/Rule_of_product ) as a basic counting rule in combinatorics.
            – trancelocation
            Nov 26 at 10:35















          up vote
          2
          down vote



          accepted











          • Choose 1 digit out of $1, ldots, 9$: $color{blue}{9}$ possibilities

          • Choose $2$ places out of $4$ to place this digit twice: $color{blue}{binom{4}{2}}$ possibilities

          • Fill the remaining $2$ places with $2$ different digits from the remaining $8$ digits: $color{blue}{8cdot 7 = P_2^8}$ possibilities


          All together
          $$color{blue}{9cdot binom{4}{2} cdot 8 cdot 7}$$






          share|cite|improve this answer





















          • Oh, now I get it, and I also get why we are multiplying everything : we do so to take into account every possible position of the two other digits, for each of the possible positions where the repeated digit can be placed, right? Thank you.
            – torito verdejo
            Nov 26 at 10:31










          • Exactly. Basis for the multiplication here is the so called "multiplication principle" (en.wikipedia.org/wiki/Rule_of_product ) as a basic counting rule in combinatorics.
            – trancelocation
            Nov 26 at 10:35













          up vote
          2
          down vote



          accepted







          up vote
          2
          down vote



          accepted







          • Choose 1 digit out of $1, ldots, 9$: $color{blue}{9}$ possibilities

          • Choose $2$ places out of $4$ to place this digit twice: $color{blue}{binom{4}{2}}$ possibilities

          • Fill the remaining $2$ places with $2$ different digits from the remaining $8$ digits: $color{blue}{8cdot 7 = P_2^8}$ possibilities


          All together
          $$color{blue}{9cdot binom{4}{2} cdot 8 cdot 7}$$






          share|cite|improve this answer













          • Choose 1 digit out of $1, ldots, 9$: $color{blue}{9}$ possibilities

          • Choose $2$ places out of $4$ to place this digit twice: $color{blue}{binom{4}{2}}$ possibilities

          • Fill the remaining $2$ places with $2$ different digits from the remaining $8$ digits: $color{blue}{8cdot 7 = P_2^8}$ possibilities


          All together
          $$color{blue}{9cdot binom{4}{2} cdot 8 cdot 7}$$







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Nov 26 at 10:21









          trancelocation

          8,7121520




          8,7121520












          • Oh, now I get it, and I also get why we are multiplying everything : we do so to take into account every possible position of the two other digits, for each of the possible positions where the repeated digit can be placed, right? Thank you.
            – torito verdejo
            Nov 26 at 10:31










          • Exactly. Basis for the multiplication here is the so called "multiplication principle" (en.wikipedia.org/wiki/Rule_of_product ) as a basic counting rule in combinatorics.
            – trancelocation
            Nov 26 at 10:35


















          • Oh, now I get it, and I also get why we are multiplying everything : we do so to take into account every possible position of the two other digits, for each of the possible positions where the repeated digit can be placed, right? Thank you.
            – torito verdejo
            Nov 26 at 10:31










          • Exactly. Basis for the multiplication here is the so called "multiplication principle" (en.wikipedia.org/wiki/Rule_of_product ) as a basic counting rule in combinatorics.
            – trancelocation
            Nov 26 at 10:35
















          Oh, now I get it, and I also get why we are multiplying everything : we do so to take into account every possible position of the two other digits, for each of the possible positions where the repeated digit can be placed, right? Thank you.
          – torito verdejo
          Nov 26 at 10:31




          Oh, now I get it, and I also get why we are multiplying everything : we do so to take into account every possible position of the two other digits, for each of the possible positions where the repeated digit can be placed, right? Thank you.
          – torito verdejo
          Nov 26 at 10:31












          Exactly. Basis for the multiplication here is the so called "multiplication principle" (en.wikipedia.org/wiki/Rule_of_product ) as a basic counting rule in combinatorics.
          – trancelocation
          Nov 26 at 10:35




          Exactly. Basis for the multiplication here is the so called "multiplication principle" (en.wikipedia.org/wiki/Rule_of_product ) as a basic counting rule in combinatorics.
          – trancelocation
          Nov 26 at 10:35


















          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.





          Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


          Please pay close attention to the following guidance:


          • 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.


          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%2f3014147%2fwhat-is-the-intuition-behind-the-resolution-method-for-this-problem%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

          Berounka

          Different font size/position of beamer's navigation symbols template's content depending on regular/plain...

          Sphinx de Gizeh