Probability : permutation or choose












-1














A club has $18$ members.



(a) How many ways are there to choose four members of the club to serve on an executive committee?
Solution: $binom{18}{4} = 3060$



(b) How many ways are there to choose a president, vice president, secretary, and treasurer of the club, where no person can hold more than one office?
Solution: $P(18,4)=18 cdot 17 cdot 16 cdot 15=73,440$




  • Sometimes, I am confused when to pick up the permutation (P) or the choose. Correct me if i am wrong but,


  • When the order matters $to$ choose


  • When the order does not matter $to$ permutation











share|cite|improve this question




















  • 2




    Other way 'round and you're good!
    – munchhausen
    Nov 29 at 0:00






  • 1




    Go for understanding, not slogans.
    – Gerry Myerson
    Nov 29 at 1:00










  • Type $binom{n}{k}$ to obtain $binom{n}{k}$. Please read this tutorial on how to typeset mathematics on this site. Also, you are not calculating a probability here. Problems of enumeration should be tagged combinatorics.
    – N. F. Taussig
    Nov 29 at 9:38


















-1














A club has $18$ members.



(a) How many ways are there to choose four members of the club to serve on an executive committee?
Solution: $binom{18}{4} = 3060$



(b) How many ways are there to choose a president, vice president, secretary, and treasurer of the club, where no person can hold more than one office?
Solution: $P(18,4)=18 cdot 17 cdot 16 cdot 15=73,440$




  • Sometimes, I am confused when to pick up the permutation (P) or the choose. Correct me if i am wrong but,


  • When the order matters $to$ choose


  • When the order does not matter $to$ permutation











share|cite|improve this question




















  • 2




    Other way 'round and you're good!
    – munchhausen
    Nov 29 at 0:00






  • 1




    Go for understanding, not slogans.
    – Gerry Myerson
    Nov 29 at 1:00










  • Type $binom{n}{k}$ to obtain $binom{n}{k}$. Please read this tutorial on how to typeset mathematics on this site. Also, you are not calculating a probability here. Problems of enumeration should be tagged combinatorics.
    – N. F. Taussig
    Nov 29 at 9:38
















-1












-1








-1







A club has $18$ members.



(a) How many ways are there to choose four members of the club to serve on an executive committee?
Solution: $binom{18}{4} = 3060$



(b) How many ways are there to choose a president, vice president, secretary, and treasurer of the club, where no person can hold more than one office?
Solution: $P(18,4)=18 cdot 17 cdot 16 cdot 15=73,440$




  • Sometimes, I am confused when to pick up the permutation (P) or the choose. Correct me if i am wrong but,


  • When the order matters $to$ choose


  • When the order does not matter $to$ permutation











share|cite|improve this question















A club has $18$ members.



(a) How many ways are there to choose four members of the club to serve on an executive committee?
Solution: $binom{18}{4} = 3060$



(b) How many ways are there to choose a president, vice president, secretary, and treasurer of the club, where no person can hold more than one office?
Solution: $P(18,4)=18 cdot 17 cdot 16 cdot 15=73,440$




  • Sometimes, I am confused when to pick up the permutation (P) or the choose. Correct me if i am wrong but,


  • When the order matters $to$ choose


  • When the order does not matter $to$ permutation








combinatorics discrete-mathematics






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Nov 29 at 9:40









N. F. Taussig

43.5k93355




43.5k93355










asked Nov 28 at 23:57









Laura1999

202




202








  • 2




    Other way 'round and you're good!
    – munchhausen
    Nov 29 at 0:00






  • 1




    Go for understanding, not slogans.
    – Gerry Myerson
    Nov 29 at 1:00










  • Type $binom{n}{k}$ to obtain $binom{n}{k}$. Please read this tutorial on how to typeset mathematics on this site. Also, you are not calculating a probability here. Problems of enumeration should be tagged combinatorics.
    – N. F. Taussig
    Nov 29 at 9:38
















  • 2




    Other way 'round and you're good!
    – munchhausen
    Nov 29 at 0:00






  • 1




    Go for understanding, not slogans.
    – Gerry Myerson
    Nov 29 at 1:00










  • Type $binom{n}{k}$ to obtain $binom{n}{k}$. Please read this tutorial on how to typeset mathematics on this site. Also, you are not calculating a probability here. Problems of enumeration should be tagged combinatorics.
    – N. F. Taussig
    Nov 29 at 9:38










2




2




Other way 'round and you're good!
– munchhausen
Nov 29 at 0:00




Other way 'round and you're good!
– munchhausen
Nov 29 at 0:00




1




1




Go for understanding, not slogans.
– Gerry Myerson
Nov 29 at 1:00




Go for understanding, not slogans.
– Gerry Myerson
Nov 29 at 1:00












Type $binom{n}{k}$ to obtain $binom{n}{k}$. Please read this tutorial on how to typeset mathematics on this site. Also, you are not calculating a probability here. Problems of enumeration should be tagged combinatorics.
– N. F. Taussig
Nov 29 at 9:38






Type $binom{n}{k}$ to obtain $binom{n}{k}$. Please read this tutorial on how to typeset mathematics on this site. Also, you are not calculating a probability here. Problems of enumeration should be tagged combinatorics.
– N. F. Taussig
Nov 29 at 9:38












1 Answer
1






active

oldest

votes


















1















(a) How many ways are there to choose four members of the club to serve on an executive committee?



Solution: $binom {18}4=3060$




You are selecting four from eigteen members.



If you are counting ways to select items, that is a count of combinations.   Combinations are not distinguished by ordering. (Order is not important.)





  • $binom n r$ or $^nmathrm C_r$ counts combinations of $r$ elements selected from a set of $n$
    $${^nmathrm C_r}= dfrac{n!}{r!cdot (n-r)!}$$





(b) How many ways are there to choose a president, vice president, secretary, and treasurer of the club, where no person can hold more than one office?



Solution: $P(18,4)=18⋅17⋅16⋅15=73,440$




You are selecting and arranging four from eighteen members into four specific positions.



If you are counting ways to select and arrange items, that is a count of permutations.   Permutations are distinguished by ordering. (Order is important!)





  • $P(n,r)$ or $^nmathrm P_r$ counts permutations of arrangements for $r$ elements selected from a set of $n$.



    $${^nmathrm P_r}= dfrac{n!}{(n-r)!}$$



  • ${^nmathrm P_r}={^nmathrm C_r}cdot r!$







share|cite|improve this answer























    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%2f3017940%2fprobability-permutation-or-choose%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









    1















    (a) How many ways are there to choose four members of the club to serve on an executive committee?



    Solution: $binom {18}4=3060$




    You are selecting four from eigteen members.



    If you are counting ways to select items, that is a count of combinations.   Combinations are not distinguished by ordering. (Order is not important.)





    • $binom n r$ or $^nmathrm C_r$ counts combinations of $r$ elements selected from a set of $n$
      $${^nmathrm C_r}= dfrac{n!}{r!cdot (n-r)!}$$





    (b) How many ways are there to choose a president, vice president, secretary, and treasurer of the club, where no person can hold more than one office?



    Solution: $P(18,4)=18⋅17⋅16⋅15=73,440$




    You are selecting and arranging four from eighteen members into four specific positions.



    If you are counting ways to select and arrange items, that is a count of permutations.   Permutations are distinguished by ordering. (Order is important!)





    • $P(n,r)$ or $^nmathrm P_r$ counts permutations of arrangements for $r$ elements selected from a set of $n$.



      $${^nmathrm P_r}= dfrac{n!}{(n-r)!}$$



    • ${^nmathrm P_r}={^nmathrm C_r}cdot r!$







    share|cite|improve this answer




























      1















      (a) How many ways are there to choose four members of the club to serve on an executive committee?



      Solution: $binom {18}4=3060$




      You are selecting four from eigteen members.



      If you are counting ways to select items, that is a count of combinations.   Combinations are not distinguished by ordering. (Order is not important.)





      • $binom n r$ or $^nmathrm C_r$ counts combinations of $r$ elements selected from a set of $n$
        $${^nmathrm C_r}= dfrac{n!}{r!cdot (n-r)!}$$





      (b) How many ways are there to choose a president, vice president, secretary, and treasurer of the club, where no person can hold more than one office?



      Solution: $P(18,4)=18⋅17⋅16⋅15=73,440$




      You are selecting and arranging four from eighteen members into four specific positions.



      If you are counting ways to select and arrange items, that is a count of permutations.   Permutations are distinguished by ordering. (Order is important!)





      • $P(n,r)$ or $^nmathrm P_r$ counts permutations of arrangements for $r$ elements selected from a set of $n$.



        $${^nmathrm P_r}= dfrac{n!}{(n-r)!}$$



      • ${^nmathrm P_r}={^nmathrm C_r}cdot r!$







      share|cite|improve this answer


























        1












        1








        1







        (a) How many ways are there to choose four members of the club to serve on an executive committee?



        Solution: $binom {18}4=3060$




        You are selecting four from eigteen members.



        If you are counting ways to select items, that is a count of combinations.   Combinations are not distinguished by ordering. (Order is not important.)





        • $binom n r$ or $^nmathrm C_r$ counts combinations of $r$ elements selected from a set of $n$
          $${^nmathrm C_r}= dfrac{n!}{r!cdot (n-r)!}$$





        (b) How many ways are there to choose a president, vice president, secretary, and treasurer of the club, where no person can hold more than one office?



        Solution: $P(18,4)=18⋅17⋅16⋅15=73,440$




        You are selecting and arranging four from eighteen members into four specific positions.



        If you are counting ways to select and arrange items, that is a count of permutations.   Permutations are distinguished by ordering. (Order is important!)





        • $P(n,r)$ or $^nmathrm P_r$ counts permutations of arrangements for $r$ elements selected from a set of $n$.



          $${^nmathrm P_r}= dfrac{n!}{(n-r)!}$$



        • ${^nmathrm P_r}={^nmathrm C_r}cdot r!$







        share|cite|improve this answer















        (a) How many ways are there to choose four members of the club to serve on an executive committee?



        Solution: $binom {18}4=3060$




        You are selecting four from eigteen members.



        If you are counting ways to select items, that is a count of combinations.   Combinations are not distinguished by ordering. (Order is not important.)





        • $binom n r$ or $^nmathrm C_r$ counts combinations of $r$ elements selected from a set of $n$
          $${^nmathrm C_r}= dfrac{n!}{r!cdot (n-r)!}$$





        (b) How many ways are there to choose a president, vice president, secretary, and treasurer of the club, where no person can hold more than one office?



        Solution: $P(18,4)=18⋅17⋅16⋅15=73,440$




        You are selecting and arranging four from eighteen members into four specific positions.



        If you are counting ways to select and arrange items, that is a count of permutations.   Permutations are distinguished by ordering. (Order is important!)





        • $P(n,r)$ or $^nmathrm P_r$ counts permutations of arrangements for $r$ elements selected from a set of $n$.



          $${^nmathrm P_r}= dfrac{n!}{(n-r)!}$$



        • ${^nmathrm P_r}={^nmathrm C_r}cdot r!$








        share|cite|improve this answer














        share|cite|improve this answer



        share|cite|improve this answer








        edited Nov 29 at 3:20

























        answered Nov 29 at 3:08









        Graham Kemp

        84.7k43378




        84.7k43378






























            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%2f3017940%2fprobability-permutation-or-choose%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

            Wiesbaden

            Marschland

            Dieringhausen