Proving the count of symmetric configurations of pentagon












2












$begingroup$


In a 3 × 3 dot grid, there are 5 configurations of symmetric pentagons. I am confused about how to prove that it is really just 5. Can anyone enlighten me?






combinatorics







share|improve this question











$endgroup$












  • $begingroup$
    Hint: each pentagon has either a straight or diagonal line of symmetry.
    $endgroup$
    – Hugh
    2 hours ago
















2












$begingroup$


In a 3 × 3 dot grid, there are 5 configurations of symmetric pentagons. I am confused about how to prove that it is really just 5. Can anyone enlighten me?






combinatorics







share|improve this question











$endgroup$












  • $begingroup$
    Hint: each pentagon has either a straight or diagonal line of symmetry.
    $endgroup$
    – Hugh
    2 hours ago














2












2








2





$begingroup$


In a 3 × 3 dot grid, there are 5 configurations of symmetric pentagons. I am confused about how to prove that it is really just 5. Can anyone enlighten me?






combinatorics







share|improve this question











$endgroup$




In a 3 × 3 dot grid, there are 5 configurations of symmetric pentagons. I am confused about how to prove that it is really just 5. Can anyone enlighten me?






combinatorics




combinatorics






share|improve this question















share|improve this question













share|improve this question




share|improve this question








edited 38 secs ago









JonMark Perry

18.9k63891




18.9k63891










asked 2 hours ago









Sierra SorongonSierra Sorongon

365




365












  • $begingroup$
    Hint: each pentagon has either a straight or diagonal line of symmetry.
    $endgroup$
    – Hugh
    2 hours ago


















  • $begingroup$
    Hint: each pentagon has either a straight or diagonal line of symmetry.
    $endgroup$
    – Hugh
    2 hours ago
















$begingroup$
Hint: each pentagon has either a straight or diagonal line of symmetry.
$endgroup$
– Hugh
2 hours ago




$begingroup$
Hint: each pentagon has either a straight or diagonal line of symmetry.
$endgroup$
– Hugh
2 hours ago










2 Answers
2






active

oldest

votes


















3












$begingroup$

Here are 5 symmetric pentagons on a $3times3$ grid:




symmetric pentagons


It can be proved by exhaustively examining the $binom95=126$ cases. After reduction by symmetry and rotation, and removing obvious cases, such as 3 in a row, and checking all drawable permutations for crossings, there are only 5 left.







share|improve this answer











$endgroup$













  • $begingroup$
    I have a proof, but I'm on mobile. I think I'll just bail and give this one to you. Good luck ! 😀
    $endgroup$
    – Hugh
    2 hours ago












  • $begingroup$
    So this is an example of proof by exhaustive search.
    $endgroup$
    – Dr Xorile
    1 hour ago



















1












$begingroup$

@JonMarkPerry got it and indicated that he'd looked through all the possibilities. But to outline the proof, you can note that:




  • The axis of symmetry must go through one of the 5 vertices (call it $A$)

  • The other 4 vertices must be symmetric to each other about the axis of symmetry.


Now note that there are only 3 vertices to choose from for vertex $A$: The center, the edge, and the corner.



The center can have an orthogonal axis of symmetry or a diagonal one.



The edge and corner will be symmetric about the line through that vertex and the center vertex.



Putting this together, there are only four cases which leads to the 5 cases already identified:




  1. Orthogonal axis of symmetry through the center vertex: 1 possibility.

  2. Diagonal axis of symmetry through the center vertex: 1 possibility

  3. Orthogonal axis of symmetry through the edge vertex: 1 possibility

  4. Diagonal axis of symmetry through the corner vertex: 2 possibilities






share|improve this answer











$endgroup$













    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: "559"
    };
    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: false,
    noModals: true,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: null,
    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%2fpuzzling.stackexchange.com%2fquestions%2f79188%2fproving-the-count-of-symmetric-configurations-of-pentagon%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown

























    2 Answers
    2






    active

    oldest

    votes








    2 Answers
    2






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    3












    $begingroup$

    Here are 5 symmetric pentagons on a $3times3$ grid:




    symmetric pentagons


    It can be proved by exhaustively examining the $binom95=126$ cases. After reduction by symmetry and rotation, and removing obvious cases, such as 3 in a row, and checking all drawable permutations for crossings, there are only 5 left.







    share|improve this answer











    $endgroup$













    • $begingroup$
      I have a proof, but I'm on mobile. I think I'll just bail and give this one to you. Good luck ! 😀
      $endgroup$
      – Hugh
      2 hours ago












    • $begingroup$
      So this is an example of proof by exhaustive search.
      $endgroup$
      – Dr Xorile
      1 hour ago
















    3












    $begingroup$

    Here are 5 symmetric pentagons on a $3times3$ grid:




    symmetric pentagons


    It can be proved by exhaustively examining the $binom95=126$ cases. After reduction by symmetry and rotation, and removing obvious cases, such as 3 in a row, and checking all drawable permutations for crossings, there are only 5 left.







    share|improve this answer











    $endgroup$













    • $begingroup$
      I have a proof, but I'm on mobile. I think I'll just bail and give this one to you. Good luck ! 😀
      $endgroup$
      – Hugh
      2 hours ago












    • $begingroup$
      So this is an example of proof by exhaustive search.
      $endgroup$
      – Dr Xorile
      1 hour ago














    3












    3








    3





    $begingroup$

    Here are 5 symmetric pentagons on a $3times3$ grid:




    symmetric pentagons


    It can be proved by exhaustively examining the $binom95=126$ cases. After reduction by symmetry and rotation, and removing obvious cases, such as 3 in a row, and checking all drawable permutations for crossings, there are only 5 left.







    share|improve this answer











    $endgroup$



    Here are 5 symmetric pentagons on a $3times3$ grid:




    symmetric pentagons


    It can be proved by exhaustively examining the $binom95=126$ cases. After reduction by symmetry and rotation, and removing obvious cases, such as 3 in a row, and checking all drawable permutations for crossings, there are only 5 left.








    share|improve this answer














    share|improve this answer



    share|improve this answer








    edited 29 mins ago

























    answered 2 hours ago









    JonMark PerryJonMark Perry

    18.9k63891




    18.9k63891












    • $begingroup$
      I have a proof, but I'm on mobile. I think I'll just bail and give this one to you. Good luck ! 😀
      $endgroup$
      – Hugh
      2 hours ago












    • $begingroup$
      So this is an example of proof by exhaustive search.
      $endgroup$
      – Dr Xorile
      1 hour ago


















    • $begingroup$
      I have a proof, but I'm on mobile. I think I'll just bail and give this one to you. Good luck ! 😀
      $endgroup$
      – Hugh
      2 hours ago












    • $begingroup$
      So this is an example of proof by exhaustive search.
      $endgroup$
      – Dr Xorile
      1 hour ago
















    $begingroup$
    I have a proof, but I'm on mobile. I think I'll just bail and give this one to you. Good luck ! 😀
    $endgroup$
    – Hugh
    2 hours ago






    $begingroup$
    I have a proof, but I'm on mobile. I think I'll just bail and give this one to you. Good luck ! 😀
    $endgroup$
    – Hugh
    2 hours ago














    $begingroup$
    So this is an example of proof by exhaustive search.
    $endgroup$
    – Dr Xorile
    1 hour ago




    $begingroup$
    So this is an example of proof by exhaustive search.
    $endgroup$
    – Dr Xorile
    1 hour ago











    1












    $begingroup$

    @JonMarkPerry got it and indicated that he'd looked through all the possibilities. But to outline the proof, you can note that:




    • The axis of symmetry must go through one of the 5 vertices (call it $A$)

    • The other 4 vertices must be symmetric to each other about the axis of symmetry.


    Now note that there are only 3 vertices to choose from for vertex $A$: The center, the edge, and the corner.



    The center can have an orthogonal axis of symmetry or a diagonal one.



    The edge and corner will be symmetric about the line through that vertex and the center vertex.



    Putting this together, there are only four cases which leads to the 5 cases already identified:




    1. Orthogonal axis of symmetry through the center vertex: 1 possibility.

    2. Diagonal axis of symmetry through the center vertex: 1 possibility

    3. Orthogonal axis of symmetry through the edge vertex: 1 possibility

    4. Diagonal axis of symmetry through the corner vertex: 2 possibilities






    share|improve this answer











    $endgroup$


















      1












      $begingroup$

      @JonMarkPerry got it and indicated that he'd looked through all the possibilities. But to outline the proof, you can note that:




      • The axis of symmetry must go through one of the 5 vertices (call it $A$)

      • The other 4 vertices must be symmetric to each other about the axis of symmetry.


      Now note that there are only 3 vertices to choose from for vertex $A$: The center, the edge, and the corner.



      The center can have an orthogonal axis of symmetry or a diagonal one.



      The edge and corner will be symmetric about the line through that vertex and the center vertex.



      Putting this together, there are only four cases which leads to the 5 cases already identified:




      1. Orthogonal axis of symmetry through the center vertex: 1 possibility.

      2. Diagonal axis of symmetry through the center vertex: 1 possibility

      3. Orthogonal axis of symmetry through the edge vertex: 1 possibility

      4. Diagonal axis of symmetry through the corner vertex: 2 possibilities






      share|improve this answer











      $endgroup$
















        1












        1








        1





        $begingroup$

        @JonMarkPerry got it and indicated that he'd looked through all the possibilities. But to outline the proof, you can note that:




        • The axis of symmetry must go through one of the 5 vertices (call it $A$)

        • The other 4 vertices must be symmetric to each other about the axis of symmetry.


        Now note that there are only 3 vertices to choose from for vertex $A$: The center, the edge, and the corner.



        The center can have an orthogonal axis of symmetry or a diagonal one.



        The edge and corner will be symmetric about the line through that vertex and the center vertex.



        Putting this together, there are only four cases which leads to the 5 cases already identified:




        1. Orthogonal axis of symmetry through the center vertex: 1 possibility.

        2. Diagonal axis of symmetry through the center vertex: 1 possibility

        3. Orthogonal axis of symmetry through the edge vertex: 1 possibility

        4. Diagonal axis of symmetry through the corner vertex: 2 possibilities






        share|improve this answer











        $endgroup$



        @JonMarkPerry got it and indicated that he'd looked through all the possibilities. But to outline the proof, you can note that:




        • The axis of symmetry must go through one of the 5 vertices (call it $A$)

        • The other 4 vertices must be symmetric to each other about the axis of symmetry.


        Now note that there are only 3 vertices to choose from for vertex $A$: The center, the edge, and the corner.



        The center can have an orthogonal axis of symmetry or a diagonal one.



        The edge and corner will be symmetric about the line through that vertex and the center vertex.



        Putting this together, there are only four cases which leads to the 5 cases already identified:




        1. Orthogonal axis of symmetry through the center vertex: 1 possibility.

        2. Diagonal axis of symmetry through the center vertex: 1 possibility

        3. Orthogonal axis of symmetry through the edge vertex: 1 possibility

        4. Diagonal axis of symmetry through the corner vertex: 2 possibilities







        share|improve this answer














        share|improve this answer



        share|improve this answer








        edited 30 mins ago

























        answered 1 hour ago









        Dr XorileDr Xorile

        11.8k22566




        11.8k22566






























            draft saved

            draft discarded




















































            Thanks for contributing an answer to Puzzling 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%2fpuzzling.stackexchange.com%2fquestions%2f79188%2fproving-the-count-of-symmetric-configurations-of-pentagon%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

            Create new schema in PostgreSQL using DBeaver

            Image
            0 At the beginning of my current job I had limited access to DB but recently my role is changed to superuser, admin, and owner. My colleague who was the previous DB admin is able to create a schema or change the permissions as there is a permission tab in the properties and he can change permissions by clicking easily. Would you please let me know how I can create schema and change permissions as well? Why his dbeaver looks different from me? He can easily right click on the schema folder on top of all schemas on the left side column and select create new schema while I do not have that, like the following picture I found on the internet. postgresql database-schema dbeaver share | improve this question
            Read more

            Deepest pit of an array with Javascript: test on Codility

            Image
            0 $begingroup$ This is the question from a Codility test, as a task in an interview: DeepestPit - problem description A non-empty zero-indexed array A consisting of N integers is given. A pit in this array is any triplet of integers (P, Q, R) such that: ·         0 ≤ P < Q < R < N; ·         sequence [A[P], A[P+1], ..., A[Q]] is strictly decreasing, i.e. A[P] > A[P+1] > ... > A[Q]; ·         sequence A[Q], A[Q+1], ..., A[R] is strictly increasing, i.e. A[Q] < A[Q+1] < ... < A[R]. The depth of a pit (P, Q, R) is the number min {A[P] − A[Q], A[R] − A[Q]}. For example, consider array A consisting of 10 elements such that: A[0] = 0 A[1] = 1 A[2] = 3 A[3] = -2 A[4] = 0 A[5] = 1 A[6] = 0 A[7] = -3 A[8] = 2 A[9] = 3 Triplet (2, 3, 4) is
            Read more

            Costa Masnaga

            Image
            .mw-parser-output .avviso .mbox-text-div>div,.mw-parser-output .avviso .mbox-text-full-div>div{font-size:90%}.mw-parser-output .avviso .mbox-image div{width:52px}.mw-parser-output .avviso .mbox-text-full-div .hide-when-compact{display:block} Questa voce o sezione sull'argomento Lombardia non cita le fonti necessarie o quelle presenti sono insufficienti . Puoi migliorare questa voce aggiungendo citazioni da fonti attendibili secondo le linee guida sull'uso delle fonti. Segui i suggerimenti del progetto di riferimento. Costa Masnaga comune Localizzazione Stato   Italia Regione Lombardia Provincia Lecco Amministrazione Sindaco Sabina Panzeri (Al centro il cittadino) dall'08/06/2009 Territorio Coordinate 45°46′N 9°17′E  /  45.766667°N 9.283333°E 45.766667; 9.283333  ( Costa Masnaga ) Coordinate: 45°46′N 9°17′E  /  45.766667°N 9.283333°E 45.766667; 9.283333  ( Costa Masnaga ) Altitudine 318 m s.l.m
            Read more