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












6












$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$

















    6












    $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$















      6












      6








      6





      $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 53 mins ago







      Huy Tran Van

















      asked 1 hour ago









      Huy Tran VanHuy Tran Van

      314




      314






















          3 Answers
          3






          active

          oldest

          votes


















          3












          $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
            27 mins ago












          • $begingroup$
            @HuyTranVan You misread. I said $1b2b34b5b6b$. There is no $b$ between $3$ and $4$.
            $endgroup$
            – orlp
            16 mins ago












          • $begingroup$
            I wanted to know why $12b3b4b5b6b$ is possible but then $1b2b34b5b6b$ (no b between 3 and 4) is not counted in the second case. According to you when one of the girls stands next to another, the question changed?
            $endgroup$
            – Huy Tran Van
            9 mins ago





















          2












          $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$

            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
              40 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









            3












            $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
              27 mins ago












            • $begingroup$
              @HuyTranVan You misread. I said $1b2b34b5b6b$. There is no $b$ between $3$ and $4$.
              $endgroup$
              – orlp
              16 mins ago












            • $begingroup$
              I wanted to know why $12b3b4b5b6b$ is possible but then $1b2b34b5b6b$ (no b between 3 and 4) is not counted in the second case. According to you when one of the girls stands next to another, the question changed?
              $endgroup$
              – Huy Tran Van
              9 mins ago


















            3












            $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
              27 mins ago












            • $begingroup$
              @HuyTranVan You misread. I said $1b2b34b5b6b$. There is no $b$ between $3$ and $4$.
              $endgroup$
              – orlp
              16 mins ago












            • $begingroup$
              I wanted to know why $12b3b4b5b6b$ is possible but then $1b2b34b5b6b$ (no b between 3 and 4) is not counted in the second case. According to you when one of the girls stands next to another, the question changed?
              $endgroup$
              – Huy Tran Van
              9 mins ago
















            3












            3








            3





            $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 52 mins ago









            orlporlp

            7,4211330




            7,4211330












            • $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
              27 mins ago












            • $begingroup$
              @HuyTranVan You misread. I said $1b2b34b5b6b$. There is no $b$ between $3$ and $4$.
              $endgroup$
              – orlp
              16 mins ago












            • $begingroup$
              I wanted to know why $12b3b4b5b6b$ is possible but then $1b2b34b5b6b$ (no b between 3 and 4) is not counted in the second case. According to you when one of the girls stands next to another, the question changed?
              $endgroup$
              – Huy Tran Van
              9 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
              27 mins ago












            • $begingroup$
              @HuyTranVan You misread. I said $1b2b34b5b6b$. There is no $b$ between $3$ and $4$.
              $endgroup$
              – orlp
              16 mins ago












            • $begingroup$
              I wanted to know why $12b3b4b5b6b$ is possible but then $1b2b34b5b6b$ (no b between 3 and 4) is not counted in the second case. According to you when one of the girls stands next to another, the question changed?
              $endgroup$
              – Huy Tran Van
              9 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
            27 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
            27 mins ago














            $begingroup$
            @HuyTranVan You misread. I said $1b2b34b5b6b$. There is no $b$ between $3$ and $4$.
            $endgroup$
            – orlp
            16 mins ago






            $begingroup$
            @HuyTranVan You misread. I said $1b2b34b5b6b$. There is no $b$ between $3$ and $4$.
            $endgroup$
            – orlp
            16 mins ago














            $begingroup$
            I wanted to know why $12b3b4b5b6b$ is possible but then $1b2b34b5b6b$ (no b between 3 and 4) is not counted in the second case. According to you when one of the girls stands next to another, the question changed?
            $endgroup$
            – Huy Tran Van
            9 mins ago






            $begingroup$
            I wanted to know why $12b3b4b5b6b$ is possible but then $1b2b34b5b6b$ (no b between 3 and 4) is not counted in the second case. According to you when one of the girls stands next to another, the question changed?
            $endgroup$
            – Huy Tran Van
            9 mins ago













            2












            $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$


















              2












              $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$
















                2












                2








                2





                $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 45 mins ago

























                answered 52 mins ago









                Chris CusterChris Custer

                11.5k3824




                11.5k3824























                    -1












                    $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
                      40 mins ago
















                    -1












                    $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
                      40 mins ago














                    -1












                    -1








                    -1





                    $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 43 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
                      40 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
                      40 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
                    40 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
                    40 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

                    Loup dans la culture

                    Image
                    Loups sur une enluminure du Bestiaire d'Aberdeen Le loup est l'animal le plus emblématique de l'histoire de l'Eurasie, il était à l'honneur durant l'Antiquité chez la totalité des anciens peuples européens [ 1 ] . Sommaire 1 Le loup dans la mythologie 2 Les loups dans le folklore 2.1 L'évolution des mentalités 2.2 Le loup dans la psychanalyse 3 Le loup dans les œuvres culturelles 3.1 Le loup dans la littérature 3.1.1 Fables 3.1.2 Poésie 3.1.3 Romans 3.1.4 Littérature jeunesse 3.1.4.1 Quelques titres d'albums contemporains 3.1.5 Bande dessinée 3.2 Le loup à l'écran 3.2.1 Le cinéma et la télévision 3.2.2 Documentaires 3.2.3 Dessins animés 3.2.4 Jeux vidéo 3.3 Le loup en peinture et en sculpture 3.4 Le loup dans les œuvres musicales 4 Le loup et les noms propres 5 Bibliographie 6 Notes et références 7 Voir aussi 7.1 Articles connexes ...
                    Read more

                    How to solve the problem of ntp “Unable to contact time server” from KDE?

                    Image
                    1 0 I want to set date and time automatically but this error appears when I try to .. I'm using openSUSE, I tried different servers but it didn't work either, help please! It doesn't seem to be a network problem: $ ping pool.ntp.org 64 bytes from 41.78.128.17: icmp_seq=1 ttl=41 time=260 ms To the question of whether ntpd is installed and running: $ ps -C ntpd PID TTY TIME CMD i.e. there's no ntpd process running. $ rpm -qa | grep ntp yast2-ntp-client-3.1.12-1.7.noarch ntp-4.2.6p5-25.2.1.i586 Further information from the comments: $ sudo ntpdate pool.ntp.org 25 Sep 19:41:51 ntpdate[3162]: no server suitable for synchronization found networking kde opensuse ntp ntpd sh...
                    Read more

                    ASUS Zenbook UX433/UX333 — Configure Touchpad-embedded numpad on Linux

                    Image
                    0 1 I have an ASUS Zenbook UX433,on which ASUS decided to innovate by embedding a Numpad inside the touchpad (see picture 1). Toggling between classic touchpad mode and numpad (also turns the touchpad LEDs on) can be done through the golden button in the top-right corner of the touchpad. However, on my Manjaro arch Linux config, this behavior does not work by default and I can only use the touchpad, no numpad. Has anyone been able to configure the numpad to work on Linux, or have any idea how this could be achieved? EDIT1: I have had a look at the official Windows drivers for the UX433FA TouchPad, but was not able to make anything of it. I tried installing them on Linux using tools like NDISWrapper, but they do not detect the TouchPad/Numpad hardware, and my understanding of drivers is too limited. ...
                    Read more