Find the number of ways that 5 boys and 6 girls can stand in a row if no boy stands next to another boy












5












$begingroup$


The most straight-forward answer is to arrange 6 girls and put 5 boys in the remaining seven slots by order:



$$square g square g square g square g square g square gsquare$$
Therefore, we come up with:



$$6!cdot 7P5=1space 814space 400$$



However, I notice that if you take one of the girls away (let's label her as $^*$), we have:



$$^*square^*g^*square^*g^*square^*g^*square^*g^*square^*g^*square^*$$



We see that no matter where girl$^*$ stands, the boys will still not stand next to each others. Now we can arrange 5 girls and put all the boys in and put girl$^*$ in the 12 places by order:
$$5!cdot6P5cdot12=1space036space800$$



Let's say we have 5 boys and 5 girls, we then have two possible arrangements:
$$gspace bspace gspace bspace gspace bspace gspace bspace gspace b + bspace gspace bspace gspace bspace gspace bspace gspace bspace g$$



Now, we add in girl$^*$. Here we have 2 different ways of arranging 5 boys and 5 girls and we are left with six slots for girl$^*$ in each case:



$$^*gspace ^*bspace ^*gspace ^*bspace ^*gspace ^*bspace ^*gspace ^*bspace ^*gspace ^*b ^*+ ^*bspace ^*gspace ^*bspace ^*gspace ^*bspace ^*gspace ^*bspace ^*gspace ^*bspace ^*g ^*$$
In which we have:
$$2(5!)^2cdot6=172space800$$



So which is right? Is there anything wrong with each logic?



Thank you.






combinatorics permutations







share|cite|improve this question











$endgroup$

















    5












    $begingroup$


    The most straight-forward answer is to arrange 6 girls and put 5 boys in the remaining seven slots by order:



    $$square g square g square g square g square g square gsquare$$
    Therefore, we come up with:



    $$6!cdot 7P5=1space 814space 400$$



    However, I notice that if you take one of the girls away (let's label her as $^*$), we have:



    $$^*square^*g^*square^*g^*square^*g^*square^*g^*square^*g^*square^*$$



    We see that no matter where girl$^*$ stands, the boys will still not stand next to each others. Now we can arrange 5 girls and put all the boys in and put girl$^*$ in the 12 places by order:
    $$5!cdot6P5cdot12=1space036space800$$



    Let's say we have 5 boys and 5 girls, we then have two possible arrangements:
    $$gspace bspace gspace bspace gspace bspace gspace bspace gspace b + bspace gspace bspace gspace bspace gspace bspace gspace bspace g$$



    Now, we add in girl$^*$. Here we have 2 different ways of arranging 5 boys and 5 girls and we are left with six slots for girl$^*$ in each case:



    $$^*gspace ^*bspace ^*gspace ^*bspace ^*gspace ^*bspace ^*gspace ^*bspace ^*gspace ^*b ^*+ ^*bspace ^*gspace ^*bspace ^*gspace ^*bspace ^*gspace ^*bspace ^*gspace ^*bspace ^*g ^*$$
    In which we have:
    $$2(5!)^2cdot6=172space800$$



    So which is right? Is there anything wrong with each logic?



    Thank you.






    combinatorics permutations







    share|cite|improve this question











    $endgroup$















      5












      5








      5





      $begingroup$


      The most straight-forward answer is to arrange 6 girls and put 5 boys in the remaining seven slots by order:



      $$square g square g square g square g square g square gsquare$$
      Therefore, we come up with:



      $$6!cdot 7P5=1space 814space 400$$



      However, I notice that if you take one of the girls away (let's label her as $^*$), we have:



      $$^*square^*g^*square^*g^*square^*g^*square^*g^*square^*g^*square^*$$



      We see that no matter where girl$^*$ stands, the boys will still not stand next to each others. Now we can arrange 5 girls and put all the boys in and put girl$^*$ in the 12 places by order:
      $$5!cdot6P5cdot12=1space036space800$$



      Let's say we have 5 boys and 5 girls, we then have two possible arrangements:
      $$gspace bspace gspace bspace gspace bspace gspace bspace gspace b + bspace gspace bspace gspace bspace gspace bspace gspace bspace g$$



      Now, we add in girl$^*$. Here we have 2 different ways of arranging 5 boys and 5 girls and we are left with six slots for girl$^*$ in each case:



      $$^*gspace ^*bspace ^*gspace ^*bspace ^*gspace ^*bspace ^*gspace ^*bspace ^*gspace ^*b ^*+ ^*bspace ^*gspace ^*bspace ^*gspace ^*bspace ^*gspace ^*bspace ^*gspace ^*bspace ^*g ^*$$
      In which we have:
      $$2(5!)^2cdot6=172space800$$



      So which is right? Is there anything wrong with each logic?



      Thank you.






      combinatorics permutations







      share|cite|improve this question











      $endgroup$




      The most straight-forward answer is to arrange 6 girls and put 5 boys in the remaining seven slots by order:



      $$square g square g square g square g square g square gsquare$$
      Therefore, we come up with:



      $$6!cdot 7P5=1space 814space 400$$



      However, I notice that if you take one of the girls away (let's label her as $^*$), we have:



      $$^*square^*g^*square^*g^*square^*g^*square^*g^*square^*g^*square^*$$



      We see that no matter where girl$^*$ stands, the boys will still not stand next to each others. Now we can arrange 5 girls and put all the boys in and put girl$^*$ in the 12 places by order:
      $$5!cdot6P5cdot12=1space036space800$$



      Let's say we have 5 boys and 5 girls, we then have two possible arrangements:
      $$gspace bspace gspace bspace gspace bspace gspace bspace gspace b + bspace gspace bspace gspace bspace gspace bspace gspace bspace g$$



      Now, we add in girl$^*$. Here we have 2 different ways of arranging 5 boys and 5 girls and we are left with six slots for girl$^*$ in each case:



      $$^*gspace ^*bspace ^*gspace ^*bspace ^*gspace ^*bspace ^*gspace ^*bspace ^*gspace ^*b ^*+ ^*bspace ^*gspace ^*bspace ^*gspace ^*bspace ^*gspace ^*bspace ^*gspace ^*bspace ^*g ^*$$
      In which we have:
      $$2(5!)^2cdot6=172space800$$



      So which is right? Is there anything wrong with each logic?



      Thank you.






      combinatorics permutations




      combinatorics permutations






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited 31 mins ago







      Huy Tran Van

















      asked 1 hour ago









      Huy Tran VanHuy Tran Van

      264




      264






















          3 Answers
          3






          active

          oldest

          votes


















          2












          $begingroup$

          Your first computation is correct.



          The latter two computations undercount because they start off by taking one of the girls away. Let's say they always take girl #1 away.



          Now if we number the girls, those solutions can contain as an example $1 2 b 3 b 4 b 5 b 6b$. But they can not contain $1b2b34b5b6b$. We've lost the ability to have two girls next to eachother without involving girl #1.






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            Now, I know the last two undercount somehow but I can't see why '$1b2b3b4b5b6b$' is not possible in the second case?
            $endgroup$
            – Huy Tran Van
            5 mins ago





















          1












          $begingroup$

          In the last one you're obviously leaving some out, which could be gotten by swapping some of bg combinations in either sum.



          In the second, also, you're not counting certain arrangements, which could be gotten by, again, swapping at least some bg combinations.



          The right one is the first.






          share|cite|improve this answer











          $endgroup$





















            0












            $begingroup$

            You are on the right track with thinking that there are 7 possible slots with 5 boys to be arranged into those slots. This is a combination problem with can be treated as a 7 choose 5 or a $7 choose 5$.

            A $7 choose 5$ is calculated as
            $$
            frac{7!}{5!*(7-5)!} = 21
            $$
            Therefore there are 21 combinations in which the boys could be arranged.



            I have also used an excel spreadsheet to show the possible ways that they could be arranged which ends up equaling 21.



            Picture of how the boys and girls could be arranged in 21 combinations






            share|cite|improve this answer








            New contributor




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






            $endgroup$













            • $begingroup$
              My answer is predicated that this is a combination problem, not a permutation problem. As they are described as boys and girls, they are likely interchangeable and this is a combination. If the question was how many ways can Tom, Dick, Harry, Sam, and Bob be arranged, that would be a different question with a much larger answer.
              $endgroup$
              – Tucktuckgoose
              18 mins ago











            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%2f3084008%2ffind-the-number-of-ways-that-5-boys-and-6-girls-can-stand-in-a-row-if-no-boy-sta%23new-answer', 'question_page');
            }
            );

            Post as a guest















            Required, but never shown

























            3 Answers
            3






            active

            oldest

            votes








            3 Answers
            3






            active

            oldest

            votes









            active

            oldest

            votes






            active

            oldest

            votes









            2












            $begingroup$

            Your first computation is correct.



            The latter two computations undercount because they start off by taking one of the girls away. Let's say they always take girl #1 away.



            Now if we number the girls, those solutions can contain as an example $1 2 b 3 b 4 b 5 b 6b$. But they can not contain $1b2b34b5b6b$. We've lost the ability to have two girls next to eachother without involving girl #1.






            share|cite|improve this answer









            $endgroup$













            • $begingroup$
              Now, I know the last two undercount somehow but I can't see why '$1b2b3b4b5b6b$' is not possible in the second case?
              $endgroup$
              – Huy Tran Van
              5 mins ago


















            2












            $begingroup$

            Your first computation is correct.



            The latter two computations undercount because they start off by taking one of the girls away. Let's say they always take girl #1 away.



            Now if we number the girls, those solutions can contain as an example $1 2 b 3 b 4 b 5 b 6b$. But they can not contain $1b2b34b5b6b$. We've lost the ability to have two girls next to eachother without involving girl #1.






            share|cite|improve this answer









            $endgroup$













            • $begingroup$
              Now, I know the last two undercount somehow but I can't see why '$1b2b3b4b5b6b$' is not possible in the second case?
              $endgroup$
              – Huy Tran Van
              5 mins ago
















            2












            2








            2





            $begingroup$

            Your first computation is correct.



            The latter two computations undercount because they start off by taking one of the girls away. Let's say they always take girl #1 away.



            Now if we number the girls, those solutions can contain as an example $1 2 b 3 b 4 b 5 b 6b$. But they can not contain $1b2b34b5b6b$. We've lost the ability to have two girls next to eachother without involving girl #1.






            share|cite|improve this answer









            $endgroup$



            Your first computation is correct.



            The latter two computations undercount because they start off by taking one of the girls away. Let's say they always take girl #1 away.



            Now if we number the girls, those solutions can contain as an example $1 2 b 3 b 4 b 5 b 6b$. But they can not contain $1b2b34b5b6b$. We've lost the ability to have two girls next to eachother without involving girl #1.







            share|cite|improve this answer












            share|cite|improve this answer



            share|cite|improve this answer










            answered 30 mins ago









            orlporlp

            7,4111330




            7,4111330












            • $begingroup$
              Now, I know the last two undercount somehow but I can't see why '$1b2b3b4b5b6b$' is not possible in the second case?
              $endgroup$
              – Huy Tran Van
              5 mins ago




















            • $begingroup$
              Now, I know the last two undercount somehow but I can't see why '$1b2b3b4b5b6b$' is not possible in the second case?
              $endgroup$
              – Huy Tran Van
              5 mins ago


















            $begingroup$
            Now, I know the last two undercount somehow but I can't see why '$1b2b3b4b5b6b$' is not possible in the second case?
            $endgroup$
            – Huy Tran Van
            5 mins ago






            $begingroup$
            Now, I know the last two undercount somehow but I can't see why '$1b2b3b4b5b6b$' is not possible in the second case?
            $endgroup$
            – Huy Tran Van
            5 mins ago













            1












            $begingroup$

            In the last one you're obviously leaving some out, which could be gotten by swapping some of bg combinations in either sum.



            In the second, also, you're not counting certain arrangements, which could be gotten by, again, swapping at least some bg combinations.



            The right one is the first.






            share|cite|improve this answer











            $endgroup$


















              1












              $begingroup$

              In the last one you're obviously leaving some out, which could be gotten by swapping some of bg combinations in either sum.



              In the second, also, you're not counting certain arrangements, which could be gotten by, again, swapping at least some bg combinations.



              The right one is the first.






              share|cite|improve this answer











              $endgroup$
















                1












                1








                1





                $begingroup$

                In the last one you're obviously leaving some out, which could be gotten by swapping some of bg combinations in either sum.



                In the second, also, you're not counting certain arrangements, which could be gotten by, again, swapping at least some bg combinations.



                The right one is the first.






                share|cite|improve this answer











                $endgroup$



                In the last one you're obviously leaving some out, which could be gotten by swapping some of bg combinations in either sum.



                In the second, also, you're not counting certain arrangements, which could be gotten by, again, swapping at least some bg combinations.



                The right one is the first.







                share|cite|improve this answer














                share|cite|improve this answer



                share|cite|improve this answer








                edited 23 mins ago

























                answered 30 mins ago









                Chris CusterChris Custer

                11.5k3824




                11.5k3824























                    0












                    $begingroup$

                    You are on the right track with thinking that there are 7 possible slots with 5 boys to be arranged into those slots. This is a combination problem with can be treated as a 7 choose 5 or a $7 choose 5$.

                    A $7 choose 5$ is calculated as
                    $$
                    frac{7!}{5!*(7-5)!} = 21
                    $$
                    Therefore there are 21 combinations in which the boys could be arranged.



                    I have also used an excel spreadsheet to show the possible ways that they could be arranged which ends up equaling 21.



                    Picture of how the boys and girls could be arranged in 21 combinations






                    share|cite|improve this answer








                    New contributor




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






                    $endgroup$













                    • $begingroup$
                      My answer is predicated that this is a combination problem, not a permutation problem. As they are described as boys and girls, they are likely interchangeable and this is a combination. If the question was how many ways can Tom, Dick, Harry, Sam, and Bob be arranged, that would be a different question with a much larger answer.
                      $endgroup$
                      – Tucktuckgoose
                      18 mins ago
















                    0












                    $begingroup$

                    You are on the right track with thinking that there are 7 possible slots with 5 boys to be arranged into those slots. This is a combination problem with can be treated as a 7 choose 5 or a $7 choose 5$.

                    A $7 choose 5$ is calculated as
                    $$
                    frac{7!}{5!*(7-5)!} = 21
                    $$
                    Therefore there are 21 combinations in which the boys could be arranged.



                    I have also used an excel spreadsheet to show the possible ways that they could be arranged which ends up equaling 21.



                    Picture of how the boys and girls could be arranged in 21 combinations






                    share|cite|improve this answer








                    New contributor




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






                    $endgroup$













                    • $begingroup$
                      My answer is predicated that this is a combination problem, not a permutation problem. As they are described as boys and girls, they are likely interchangeable and this is a combination. If the question was how many ways can Tom, Dick, Harry, Sam, and Bob be arranged, that would be a different question with a much larger answer.
                      $endgroup$
                      – Tucktuckgoose
                      18 mins ago














                    0












                    0








                    0





                    $begingroup$

                    You are on the right track with thinking that there are 7 possible slots with 5 boys to be arranged into those slots. This is a combination problem with can be treated as a 7 choose 5 or a $7 choose 5$.

                    A $7 choose 5$ is calculated as
                    $$
                    frac{7!}{5!*(7-5)!} = 21
                    $$
                    Therefore there are 21 combinations in which the boys could be arranged.



                    I have also used an excel spreadsheet to show the possible ways that they could be arranged which ends up equaling 21.



                    Picture of how the boys and girls could be arranged in 21 combinations






                    share|cite|improve this answer








                    New contributor




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






                    $endgroup$



                    You are on the right track with thinking that there are 7 possible slots with 5 boys to be arranged into those slots. This is a combination problem with can be treated as a 7 choose 5 or a $7 choose 5$.

                    A $7 choose 5$ is calculated as
                    $$
                    frac{7!}{5!*(7-5)!} = 21
                    $$
                    Therefore there are 21 combinations in which the boys could be arranged.



                    I have also used an excel spreadsheet to show the possible ways that they could be arranged which ends up equaling 21.



                    Picture of how the boys and girls could be arranged in 21 combinations







                    share|cite|improve this answer








                    New contributor




                    Tucktuckgoose 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 answer



                    share|cite|improve this answer






                    New contributor




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









                    answered 20 mins ago









                    TucktuckgooseTucktuckgoose

                    11




                    11




                    New contributor




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





                    New contributor





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






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












                    • $begingroup$
                      My answer is predicated that this is a combination problem, not a permutation problem. As they are described as boys and girls, they are likely interchangeable and this is a combination. If the question was how many ways can Tom, Dick, Harry, Sam, and Bob be arranged, that would be a different question with a much larger answer.
                      $endgroup$
                      – Tucktuckgoose
                      18 mins ago


















                    • $begingroup$
                      My answer is predicated that this is a combination problem, not a permutation problem. As they are described as boys and girls, they are likely interchangeable and this is a combination. If the question was how many ways can Tom, Dick, Harry, Sam, and Bob be arranged, that would be a different question with a much larger answer.
                      $endgroup$
                      – Tucktuckgoose
                      18 mins ago
















                    $begingroup$
                    My answer is predicated that this is a combination problem, not a permutation problem. As they are described as boys and girls, they are likely interchangeable and this is a combination. If the question was how many ways can Tom, Dick, Harry, Sam, and Bob be arranged, that would be a different question with a much larger answer.
                    $endgroup$
                    – Tucktuckgoose
                    18 mins ago




                    $begingroup$
                    My answer is predicated that this is a combination problem, not a permutation problem. As they are described as boys and girls, they are likely interchangeable and this is a combination. If the question was how many ways can Tom, Dick, Harry, Sam, and Bob be arranged, that would be a different question with a much larger answer.
                    $endgroup$
                    – Tucktuckgoose
                    18 mins ago


















                    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%2f3084008%2ffind-the-number-of-ways-that-5-boys-and-6-girls-can-stand-in-a-row-if-no-boy-sta%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

                    404 Error Contact Form 7 ajax form submitting

                    Image
                    0 The contact form does not work, and affects loading after one try. The chrome console shows the error message: POST http://example.com/wp-json/contact-form-7/v1/contact-forms/50/feedback 404 (Not Found) send @ jquery.js?ver=1.12.4:4 ajax @ jquery.js?ver=1.12.4:4 wpcf7.submit @ scripts.js?ver=5.0.3:346 (anonymous) @ scripts.js?ver=5.0.3:53 dispatch @ jquery.js?ver=1.12.4:3 r.handle @ jquery.js?ver=1.12.4:3 How to solve this issue? thanks in advance javascript wordpress contact-form-7 share | improve this question edited Jul 17 '18 at 5:39 Kiran Shahi 4,745 3 16 43 ...
                    Read more

                    How to know if a Active Directory user can login interactively

                    Image
                    1 I would like to know if and how is it possible to know if a AD user can login interactively (on a server) in a domain. I need to know if I can find it out using a LDAP search. Thanks. windows active-directory login user-permissions user-profile share | improve this question edited 1 hour ago yagmoth555 ♦ 11.6k 3 17 42 asked 1 hour ago Luigi Luigi 6 1 New contributor ...
                    Read more

                    Refactoring coordinates for Minecraft Pi buildings written in Python

                    Image
                    0 $begingroup$ I'm fairly new to coding and I wrote this script in Python for a house with a roof in Minecraft Pi. I've found different ways to write the coordinates to make the code base shorter, but I'm wondering if it is possible for me to refactor it any further so I don't have to list each coordinate line by line. import mcpi.minecraft as minecraft import mcpi.block as block mc = minecraft.Minecraft.create() p = mc.player.getTilePos() mc.setBlocks(p.x+1, p.y, p.z+1, #Main structure starting coordinates (DO NOT ALTER) p.x+19, p.y+4, p.z+6, #Structure size/coordinates (Alters cube size) block.STONE_BRICK) mc.setBlocks(p.x+2, p.y+1, p.z+2, #Hollowing out main structure interior p.x+18, p.y+3, p.z+5, block.AIR) mc.setBlocks(p.x, p.y...
                    Read more