Proving the count of symmetric configurations of pentagon
Clash Royale CLAN TAG#URR8PPP
$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?
geometry combinatorics
$endgroup$
add a comment |
$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?
geometry combinatorics
$endgroup$
$begingroup$
Hint: each pentagon has either a straight or diagonal line of symmetry.
$endgroup$
– Hugh
Feb 2 at 3:27
add a comment |
$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?
geometry combinatorics
$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?
geometry combinatorics
geometry combinatorics
edited Feb 2 at 7:31
Omega Krypton
4,4051440
4,4051440
asked Feb 2 at 2:48
Sierra SorongonSierra Sorongon
465
465
$begingroup$
Hint: each pentagon has either a straight or diagonal line of symmetry.
$endgroup$
– Hugh
Feb 2 at 3:27
add a comment |
$begingroup$
Hint: each pentagon has either a straight or diagonal line of symmetry.
$endgroup$
– Hugh
Feb 2 at 3:27
$begingroup$
Hint: each pentagon has either a straight or diagonal line of symmetry.
$endgroup$
– Hugh
Feb 2 at 3:27
$begingroup$
Hint: each pentagon has either a straight or diagonal line of symmetry.
$endgroup$
– Hugh
Feb 2 at 3:27
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
Here are 5 symmetric pentagons on a $3times3$ grid:
A proof is to notice that there are only two lines of mirror symmetry on the grid, vertical (or horizontal by rotation) and diagonal. A line of symmetry can only contain 1 vertex, because the other vertices are mirrored, and 3 in a row is impossible (a vertex would have 3 edges). There are only 3 variations for each of the two possible LoS vertices, giving only 12 cases to test, and 12 ways to draw each one (12345 is the same as 23451 is the same as 54321), so there are only 144 possibilities to check.
$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
Feb 2 at 3:25
$begingroup$
So this is an example of proof by exhaustive search.
$endgroup$
– Dr Xorile
Feb 2 at 4:01
add a comment |
$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:
- Orthogonal axis of symmetry through the center vertex: 1 possibility.
- Diagonal axis of symmetry through the center vertex: 1 possibility
- Orthogonal axis of symmetry through the edge vertex: 1 possibility
- Diagonal axis of symmetry through the corner vertex: 2 possibilities
$endgroup$
add a comment |
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
);
);
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
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
$begingroup$
Here are 5 symmetric pentagons on a $3times3$ grid:
A proof is to notice that there are only two lines of mirror symmetry on the grid, vertical (or horizontal by rotation) and diagonal. A line of symmetry can only contain 1 vertex, because the other vertices are mirrored, and 3 in a row is impossible (a vertex would have 3 edges). There are only 3 variations for each of the two possible LoS vertices, giving only 12 cases to test, and 12 ways to draw each one (12345 is the same as 23451 is the same as 54321), so there are only 144 possibilities to check.
$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
Feb 2 at 3:25
$begingroup$
So this is an example of proof by exhaustive search.
$endgroup$
– Dr Xorile
Feb 2 at 4:01
add a comment |
$begingroup$
Here are 5 symmetric pentagons on a $3times3$ grid:
A proof is to notice that there are only two lines of mirror symmetry on the grid, vertical (or horizontal by rotation) and diagonal. A line of symmetry can only contain 1 vertex, because the other vertices are mirrored, and 3 in a row is impossible (a vertex would have 3 edges). There are only 3 variations for each of the two possible LoS vertices, giving only 12 cases to test, and 12 ways to draw each one (12345 is the same as 23451 is the same as 54321), so there are only 144 possibilities to check.
$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
Feb 2 at 3:25
$begingroup$
So this is an example of proof by exhaustive search.
$endgroup$
– Dr Xorile
Feb 2 at 4:01
add a comment |
$begingroup$
Here are 5 symmetric pentagons on a $3times3$ grid:
A proof is to notice that there are only two lines of mirror symmetry on the grid, vertical (or horizontal by rotation) and diagonal. A line of symmetry can only contain 1 vertex, because the other vertices are mirrored, and 3 in a row is impossible (a vertex would have 3 edges). There are only 3 variations for each of the two possible LoS vertices, giving only 12 cases to test, and 12 ways to draw each one (12345 is the same as 23451 is the same as 54321), so there are only 144 possibilities to check.
$endgroup$
Here are 5 symmetric pentagons on a $3times3$ grid:
A proof is to notice that there are only two lines of mirror symmetry on the grid, vertical (or horizontal by rotation) and diagonal. A line of symmetry can only contain 1 vertex, because the other vertices are mirrored, and 3 in a row is impossible (a vertex would have 3 edges). There are only 3 variations for each of the two possible LoS vertices, giving only 12 cases to test, and 12 ways to draw each one (12345 is the same as 23451 is the same as 54321), so there are only 144 possibilities to check.
edited Feb 2 at 11:04
answered Feb 2 at 3:23
JonMark PerryJonMark Perry
19.2k63991
19.2k63991
$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
Feb 2 at 3:25
$begingroup$
So this is an example of proof by exhaustive search.
$endgroup$
– Dr Xorile
Feb 2 at 4:01
add a comment |
$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
Feb 2 at 3:25
$begingroup$
So this is an example of proof by exhaustive search.
$endgroup$
– Dr Xorile
Feb 2 at 4:01
$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
Feb 2 at 3:25
$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
Feb 2 at 3:25
$begingroup$
So this is an example of proof by exhaustive search.
$endgroup$
– Dr Xorile
Feb 2 at 4:01
$begingroup$
So this is an example of proof by exhaustive search.
$endgroup$
– Dr Xorile
Feb 2 at 4:01
add a comment |
$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:
- Orthogonal axis of symmetry through the center vertex: 1 possibility.
- Diagonal axis of symmetry through the center vertex: 1 possibility
- Orthogonal axis of symmetry through the edge vertex: 1 possibility
- Diagonal axis of symmetry through the corner vertex: 2 possibilities
$endgroup$
add a comment |
$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:
- Orthogonal axis of symmetry through the center vertex: 1 possibility.
- Diagonal axis of symmetry through the center vertex: 1 possibility
- Orthogonal axis of symmetry through the edge vertex: 1 possibility
- Diagonal axis of symmetry through the corner vertex: 2 possibilities
$endgroup$
add a comment |
$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:
- Orthogonal axis of symmetry through the center vertex: 1 possibility.
- Diagonal axis of symmetry through the center vertex: 1 possibility
- Orthogonal axis of symmetry through the edge vertex: 1 possibility
- Diagonal axis of symmetry through the corner vertex: 2 possibilities
$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:
- Orthogonal axis of symmetry through the center vertex: 1 possibility.
- Diagonal axis of symmetry through the center vertex: 1 possibility
- Orthogonal axis of symmetry through the edge vertex: 1 possibility
- Diagonal axis of symmetry through the corner vertex: 2 possibilities
edited Feb 2 at 5:04
answered Feb 2 at 4:20
Dr XorileDr Xorile
12.6k22569
12.6k22569
add a comment |
add a comment |
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.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
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
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
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
$begingroup$
Hint: each pentagon has either a straight or diagonal line of symmetry.
$endgroup$
– Hugh
Feb 2 at 3:27