Question on convex pentagons with lattice points as its vertices
$begingroup$
I have the following question which I found as an example in a book with me:
"All vertices of a convex pentagon are lattice points, and its sides have integral length. Show that its perimeter is even"
The book starts the solution like this:
"Colour the lattices as in a chess board and erect right triangles on the sides of the pentagon with the sides of the pentagon as the longest side. With the other two sides along the sides of the square trace the ten shorter sides. Since at the end we return to the point we started we must have traced an even number of lattice points."
How is the last statement concluded?
graph-theory
$endgroup$
add a comment |
$begingroup$
I have the following question which I found as an example in a book with me:
"All vertices of a convex pentagon are lattice points, and its sides have integral length. Show that its perimeter is even"
The book starts the solution like this:
"Colour the lattices as in a chess board and erect right triangles on the sides of the pentagon with the sides of the pentagon as the longest side. With the other two sides along the sides of the square trace the ten shorter sides. Since at the end we return to the point we started we must have traced an even number of lattice points."
How is the last statement concluded?
graph-theory
$endgroup$
add a comment |
$begingroup$
I have the following question which I found as an example in a book with me:
"All vertices of a convex pentagon are lattice points, and its sides have integral length. Show that its perimeter is even"
The book starts the solution like this:
"Colour the lattices as in a chess board and erect right triangles on the sides of the pentagon with the sides of the pentagon as the longest side. With the other two sides along the sides of the square trace the ten shorter sides. Since at the end we return to the point we started we must have traced an even number of lattice points."
How is the last statement concluded?
graph-theory
$endgroup$
I have the following question which I found as an example in a book with me:
"All vertices of a convex pentagon are lattice points, and its sides have integral length. Show that its perimeter is even"
The book starts the solution like this:
"Colour the lattices as in a chess board and erect right triangles on the sides of the pentagon with the sides of the pentagon as the longest side. With the other two sides along the sides of the square trace the ten shorter sides. Since at the end we return to the point we started we must have traced an even number of lattice points."
How is the last statement concluded?
graph-theory
graph-theory
asked Dec 1 '18 at 7:21
saisanjeevsaisanjeev
947212
947212
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
There are two parts to that reasoning:
- Replacing a slanted edge with two edges in the axial directions doesn't change whether the perimeter is odd. This follows from the fact that every primitive Pythagorean triple has exactly one odd leg and an odd hypotenuse; we either replace odd with odd+even or even with even+even.
- A closed lattice polygon with all sides in the axial directions must have even perimeter. This is what the chessboard coloring (best done with the squares centered at lattice points) is for; we alternate colors with every 1 unit we travel, and eventually return to the start. That's an even number of changes, for an even total distance.
Alternately, we can show that the sum of the edges in the $x$-direction and the sum of the edges in the $y$-direction are both even, by similar reasoning in one dimension.
$endgroup$
$begingroup$
What if one of the sides of the pentagon is along one of the axial directions?
$endgroup$
– saisanjeev
Dec 2 '18 at 7:09
$begingroup$
If one of the sides is already along an axial direction, we don't bother replacing it. Note that the number of edges never actually matters. It might say "the ten shorter sides", but we never use that there are ten of them.
$endgroup$
– jmerry
Dec 2 '18 at 7:28
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: "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
});
}
});
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%2fmath.stackexchange.com%2fquestions%2f3021087%2fquestion-on-convex-pentagons-with-lattice-points-as-its-vertices%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
There are two parts to that reasoning:
- Replacing a slanted edge with two edges in the axial directions doesn't change whether the perimeter is odd. This follows from the fact that every primitive Pythagorean triple has exactly one odd leg and an odd hypotenuse; we either replace odd with odd+even or even with even+even.
- A closed lattice polygon with all sides in the axial directions must have even perimeter. This is what the chessboard coloring (best done with the squares centered at lattice points) is for; we alternate colors with every 1 unit we travel, and eventually return to the start. That's an even number of changes, for an even total distance.
Alternately, we can show that the sum of the edges in the $x$-direction and the sum of the edges in the $y$-direction are both even, by similar reasoning in one dimension.
$endgroup$
$begingroup$
What if one of the sides of the pentagon is along one of the axial directions?
$endgroup$
– saisanjeev
Dec 2 '18 at 7:09
$begingroup$
If one of the sides is already along an axial direction, we don't bother replacing it. Note that the number of edges never actually matters. It might say "the ten shorter sides", but we never use that there are ten of them.
$endgroup$
– jmerry
Dec 2 '18 at 7:28
add a comment |
$begingroup$
There are two parts to that reasoning:
- Replacing a slanted edge with two edges in the axial directions doesn't change whether the perimeter is odd. This follows from the fact that every primitive Pythagorean triple has exactly one odd leg and an odd hypotenuse; we either replace odd with odd+even or even with even+even.
- A closed lattice polygon with all sides in the axial directions must have even perimeter. This is what the chessboard coloring (best done with the squares centered at lattice points) is for; we alternate colors with every 1 unit we travel, and eventually return to the start. That's an even number of changes, for an even total distance.
Alternately, we can show that the sum of the edges in the $x$-direction and the sum of the edges in the $y$-direction are both even, by similar reasoning in one dimension.
$endgroup$
$begingroup$
What if one of the sides of the pentagon is along one of the axial directions?
$endgroup$
– saisanjeev
Dec 2 '18 at 7:09
$begingroup$
If one of the sides is already along an axial direction, we don't bother replacing it. Note that the number of edges never actually matters. It might say "the ten shorter sides", but we never use that there are ten of them.
$endgroup$
– jmerry
Dec 2 '18 at 7:28
add a comment |
$begingroup$
There are two parts to that reasoning:
- Replacing a slanted edge with two edges in the axial directions doesn't change whether the perimeter is odd. This follows from the fact that every primitive Pythagorean triple has exactly one odd leg and an odd hypotenuse; we either replace odd with odd+even or even with even+even.
- A closed lattice polygon with all sides in the axial directions must have even perimeter. This is what the chessboard coloring (best done with the squares centered at lattice points) is for; we alternate colors with every 1 unit we travel, and eventually return to the start. That's an even number of changes, for an even total distance.
Alternately, we can show that the sum of the edges in the $x$-direction and the sum of the edges in the $y$-direction are both even, by similar reasoning in one dimension.
$endgroup$
There are two parts to that reasoning:
- Replacing a slanted edge with two edges in the axial directions doesn't change whether the perimeter is odd. This follows from the fact that every primitive Pythagorean triple has exactly one odd leg and an odd hypotenuse; we either replace odd with odd+even or even with even+even.
- A closed lattice polygon with all sides in the axial directions must have even perimeter. This is what the chessboard coloring (best done with the squares centered at lattice points) is for; we alternate colors with every 1 unit we travel, and eventually return to the start. That's an even number of changes, for an even total distance.
Alternately, we can show that the sum of the edges in the $x$-direction and the sum of the edges in the $y$-direction are both even, by similar reasoning in one dimension.
answered Dec 1 '18 at 7:56
jmerryjmerry
3,457413
3,457413
$begingroup$
What if one of the sides of the pentagon is along one of the axial directions?
$endgroup$
– saisanjeev
Dec 2 '18 at 7:09
$begingroup$
If one of the sides is already along an axial direction, we don't bother replacing it. Note that the number of edges never actually matters. It might say "the ten shorter sides", but we never use that there are ten of them.
$endgroup$
– jmerry
Dec 2 '18 at 7:28
add a comment |
$begingroup$
What if one of the sides of the pentagon is along one of the axial directions?
$endgroup$
– saisanjeev
Dec 2 '18 at 7:09
$begingroup$
If one of the sides is already along an axial direction, we don't bother replacing it. Note that the number of edges never actually matters. It might say "the ten shorter sides", but we never use that there are ten of them.
$endgroup$
– jmerry
Dec 2 '18 at 7:28
$begingroup$
What if one of the sides of the pentagon is along one of the axial directions?
$endgroup$
– saisanjeev
Dec 2 '18 at 7:09
$begingroup$
What if one of the sides of the pentagon is along one of the axial directions?
$endgroup$
– saisanjeev
Dec 2 '18 at 7:09
$begingroup$
If one of the sides is already along an axial direction, we don't bother replacing it. Note that the number of edges never actually matters. It might say "the ten shorter sides", but we never use that there are ten of them.
$endgroup$
– jmerry
Dec 2 '18 at 7:28
$begingroup$
If one of the sides is already along an axial direction, we don't bother replacing it. Note that the number of edges never actually matters. It might say "the ten shorter sides", but we never use that there are ten of them.
$endgroup$
– jmerry
Dec 2 '18 at 7:28
add a comment |
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.
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%2fmath.stackexchange.com%2fquestions%2f3021087%2fquestion-on-convex-pentagons-with-lattice-points-as-its-vertices%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