Drawing a figure without lifting the pen
A friend of mine said that if you can draw the figure below without lifting your hand and without going over a piece for a second time, you can do whatever you want. I couldn't do it, no matter how I tried. There's always one piece missing.
Is it possible to draw this shape without lifting the pen and passing over the part already drawn?
puzzle
add a comment |
A friend of mine said that if you can draw the figure below without lifting your hand and without going over a piece for a second time, you can do whatever you want. I couldn't do it, no matter how I tried. There's always one piece missing.
Is it possible to draw this shape without lifting the pen and passing over the part already drawn?
puzzle
2
en.wikipedia.org/wiki/Seven_Bridges_of_Königsberg
– Martin R
Nov 23 '18 at 11:39
Similar: math.stackexchange.com/questions/292909/…
– Martin R
Nov 23 '18 at 11:46
1
Proof by contradiction: Suppose you can draw the figure without lifting your hand and without going over a segment twice. It is given in the problem that if this is possible, then you can do whatever you want. However, we already know that you cannot do whatever you want. Therefore, the assumption must be false.
– Rahul
Nov 23 '18 at 11:46
add a comment |
A friend of mine said that if you can draw the figure below without lifting your hand and without going over a piece for a second time, you can do whatever you want. I couldn't do it, no matter how I tried. There's always one piece missing.
Is it possible to draw this shape without lifting the pen and passing over the part already drawn?
puzzle
A friend of mine said that if you can draw the figure below without lifting your hand and without going over a piece for a second time, you can do whatever you want. I couldn't do it, no matter how I tried. There's always one piece missing.
Is it possible to draw this shape without lifting the pen and passing over the part already drawn?
puzzle
puzzle
edited Nov 23 '18 at 12:03
Blue
47.7k870151
47.7k870151
asked Nov 23 '18 at 11:28
1Spectre11Spectre1
999
999
2
en.wikipedia.org/wiki/Seven_Bridges_of_Königsberg
– Martin R
Nov 23 '18 at 11:39
Similar: math.stackexchange.com/questions/292909/…
– Martin R
Nov 23 '18 at 11:46
1
Proof by contradiction: Suppose you can draw the figure without lifting your hand and without going over a segment twice. It is given in the problem that if this is possible, then you can do whatever you want. However, we already know that you cannot do whatever you want. Therefore, the assumption must be false.
– Rahul
Nov 23 '18 at 11:46
add a comment |
2
en.wikipedia.org/wiki/Seven_Bridges_of_Königsberg
– Martin R
Nov 23 '18 at 11:39
Similar: math.stackexchange.com/questions/292909/…
– Martin R
Nov 23 '18 at 11:46
1
Proof by contradiction: Suppose you can draw the figure without lifting your hand and without going over a segment twice. It is given in the problem that if this is possible, then you can do whatever you want. However, we already know that you cannot do whatever you want. Therefore, the assumption must be false.
– Rahul
Nov 23 '18 at 11:46
2
2
en.wikipedia.org/wiki/Seven_Bridges_of_Königsberg
– Martin R
Nov 23 '18 at 11:39
en.wikipedia.org/wiki/Seven_Bridges_of_Königsberg
– Martin R
Nov 23 '18 at 11:39
Similar: math.stackexchange.com/questions/292909/…
– Martin R
Nov 23 '18 at 11:46
Similar: math.stackexchange.com/questions/292909/…
– Martin R
Nov 23 '18 at 11:46
1
1
Proof by contradiction: Suppose you can draw the figure without lifting your hand and without going over a segment twice. It is given in the problem that if this is possible, then you can do whatever you want. However, we already know that you cannot do whatever you want. Therefore, the assumption must be false.
– Rahul
Nov 23 '18 at 11:46
Proof by contradiction: Suppose you can draw the figure without lifting your hand and without going over a segment twice. It is given in the problem that if this is possible, then you can do whatever you want. However, we already know that you cannot do whatever you want. Therefore, the assumption must be false.
– Rahul
Nov 23 '18 at 11:46
add a comment |
4 Answers
4
active
oldest
votes
It cannot be done and here is why. Let’s call the points where several lines together intersections. Now, if you had a single path that would cover the whole figure without going over any of the lines twice, then that means that any time you go into an intersection drawing one line, you need to leave that intersection again using a different line. This means that every intersection should be an intersection of an even number of lines. The only possible exceptions to this is when you start the path or end the path, so two intersections can have an odd number of lines ... but the rest must be all even. However, note that you have four intersections with five lines. So, it cannot be done.
add a comment |
No, as there are four 5-nodes.
add a comment |
We'll as just it is not mentioned in the question that we have to use a single hand. Try using 2 hands and draw.
add a comment |
He could be asking a trick question. You could draw that figure with your finger on say an iPad, whilst keeping your hand rested the entire tea (but still lifting your finger). If you're drawing it in such a method, then you could do whatever you want with that image. Not just not going over a piece for a second time (by lightning your finger and keeping hand rested once again), but also add extra lines, make it red, delete it entirely. In that case, what your friend said is true - you can draw it without lifting your hand and do whatever you want.
In terms of solving it the proper mathematical way by only using a pen and no tricks like in the above paragraph, then no you cannot. As alluded to in the other answers, the number of nodes (points where several lines intersect) connected to an odd number of lines cannot exceed 2. In this case there are 4 odd-numbered nodes (nodes connected to an odd number of lines), in this case the corners of the inner rectangle. The reason behind this is that to cross every line without lifting your pen, each odd-numbered node must either be started at or ended at (or both). That is not possible if there are more than 2 odd-numbered nodes.
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%2f3010253%2fdrawing-a-figure-without-lifting-the-pen%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
4 Answers
4
active
oldest
votes
4 Answers
4
active
oldest
votes
active
oldest
votes
active
oldest
votes
It cannot be done and here is why. Let’s call the points where several lines together intersections. Now, if you had a single path that would cover the whole figure without going over any of the lines twice, then that means that any time you go into an intersection drawing one line, you need to leave that intersection again using a different line. This means that every intersection should be an intersection of an even number of lines. The only possible exceptions to this is when you start the path or end the path, so two intersections can have an odd number of lines ... but the rest must be all even. However, note that you have four intersections with five lines. So, it cannot be done.
add a comment |
It cannot be done and here is why. Let’s call the points where several lines together intersections. Now, if you had a single path that would cover the whole figure without going over any of the lines twice, then that means that any time you go into an intersection drawing one line, you need to leave that intersection again using a different line. This means that every intersection should be an intersection of an even number of lines. The only possible exceptions to this is when you start the path or end the path, so two intersections can have an odd number of lines ... but the rest must be all even. However, note that you have four intersections with five lines. So, it cannot be done.
add a comment |
It cannot be done and here is why. Let’s call the points where several lines together intersections. Now, if you had a single path that would cover the whole figure without going over any of the lines twice, then that means that any time you go into an intersection drawing one line, you need to leave that intersection again using a different line. This means that every intersection should be an intersection of an even number of lines. The only possible exceptions to this is when you start the path or end the path, so two intersections can have an odd number of lines ... but the rest must be all even. However, note that you have four intersections with five lines. So, it cannot be done.
It cannot be done and here is why. Let’s call the points where several lines together intersections. Now, if you had a single path that would cover the whole figure without going over any of the lines twice, then that means that any time you go into an intersection drawing one line, you need to leave that intersection again using a different line. This means that every intersection should be an intersection of an even number of lines. The only possible exceptions to this is when you start the path or end the path, so two intersections can have an odd number of lines ... but the rest must be all even. However, note that you have four intersections with five lines. So, it cannot be done.
edited Nov 23 '18 at 18:16
answered Nov 23 '18 at 13:42
Bram28Bram28
60.4k44590
60.4k44590
add a comment |
add a comment |
No, as there are four 5-nodes.
add a comment |
No, as there are four 5-nodes.
add a comment |
No, as there are four 5-nodes.
No, as there are four 5-nodes.
answered Nov 23 '18 at 11:32
Richard MartinRichard Martin
1,61118
1,61118
add a comment |
add a comment |
We'll as just it is not mentioned in the question that we have to use a single hand. Try using 2 hands and draw.
add a comment |
We'll as just it is not mentioned in the question that we have to use a single hand. Try using 2 hands and draw.
add a comment |
We'll as just it is not mentioned in the question that we have to use a single hand. Try using 2 hands and draw.
We'll as just it is not mentioned in the question that we have to use a single hand. Try using 2 hands and draw.
answered Nov 26 '18 at 8:57
Atharva KathaleAtharva Kathale
889
889
add a comment |
add a comment |
He could be asking a trick question. You could draw that figure with your finger on say an iPad, whilst keeping your hand rested the entire tea (but still lifting your finger). If you're drawing it in such a method, then you could do whatever you want with that image. Not just not going over a piece for a second time (by lightning your finger and keeping hand rested once again), but also add extra lines, make it red, delete it entirely. In that case, what your friend said is true - you can draw it without lifting your hand and do whatever you want.
In terms of solving it the proper mathematical way by only using a pen and no tricks like in the above paragraph, then no you cannot. As alluded to in the other answers, the number of nodes (points where several lines intersect) connected to an odd number of lines cannot exceed 2. In this case there are 4 odd-numbered nodes (nodes connected to an odd number of lines), in this case the corners of the inner rectangle. The reason behind this is that to cross every line without lifting your pen, each odd-numbered node must either be started at or ended at (or both). That is not possible if there are more than 2 odd-numbered nodes.
add a comment |
He could be asking a trick question. You could draw that figure with your finger on say an iPad, whilst keeping your hand rested the entire tea (but still lifting your finger). If you're drawing it in such a method, then you could do whatever you want with that image. Not just not going over a piece for a second time (by lightning your finger and keeping hand rested once again), but also add extra lines, make it red, delete it entirely. In that case, what your friend said is true - you can draw it without lifting your hand and do whatever you want.
In terms of solving it the proper mathematical way by only using a pen and no tricks like in the above paragraph, then no you cannot. As alluded to in the other answers, the number of nodes (points where several lines intersect) connected to an odd number of lines cannot exceed 2. In this case there are 4 odd-numbered nodes (nodes connected to an odd number of lines), in this case the corners of the inner rectangle. The reason behind this is that to cross every line without lifting your pen, each odd-numbered node must either be started at or ended at (or both). That is not possible if there are more than 2 odd-numbered nodes.
add a comment |
He could be asking a trick question. You could draw that figure with your finger on say an iPad, whilst keeping your hand rested the entire tea (but still lifting your finger). If you're drawing it in such a method, then you could do whatever you want with that image. Not just not going over a piece for a second time (by lightning your finger and keeping hand rested once again), but also add extra lines, make it red, delete it entirely. In that case, what your friend said is true - you can draw it without lifting your hand and do whatever you want.
In terms of solving it the proper mathematical way by only using a pen and no tricks like in the above paragraph, then no you cannot. As alluded to in the other answers, the number of nodes (points where several lines intersect) connected to an odd number of lines cannot exceed 2. In this case there are 4 odd-numbered nodes (nodes connected to an odd number of lines), in this case the corners of the inner rectangle. The reason behind this is that to cross every line without lifting your pen, each odd-numbered node must either be started at or ended at (or both). That is not possible if there are more than 2 odd-numbered nodes.
He could be asking a trick question. You could draw that figure with your finger on say an iPad, whilst keeping your hand rested the entire tea (but still lifting your finger). If you're drawing it in such a method, then you could do whatever you want with that image. Not just not going over a piece for a second time (by lightning your finger and keeping hand rested once again), but also add extra lines, make it red, delete it entirely. In that case, what your friend said is true - you can draw it without lifting your hand and do whatever you want.
In terms of solving it the proper mathematical way by only using a pen and no tricks like in the above paragraph, then no you cannot. As alluded to in the other answers, the number of nodes (points where several lines intersect) connected to an odd number of lines cannot exceed 2. In this case there are 4 odd-numbered nodes (nodes connected to an odd number of lines), in this case the corners of the inner rectangle. The reason behind this is that to cross every line without lifting your pen, each odd-numbered node must either be started at or ended at (or both). That is not possible if there are more than 2 odd-numbered nodes.
answered Nov 27 '18 at 9:37
MBorgMBorg
1751114
1751114
add a comment |
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%2f3010253%2fdrawing-a-figure-without-lifting-the-pen%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
2
en.wikipedia.org/wiki/Seven_Bridges_of_Königsberg
– Martin R
Nov 23 '18 at 11:39
Similar: math.stackexchange.com/questions/292909/…
– Martin R
Nov 23 '18 at 11:46
1
Proof by contradiction: Suppose you can draw the figure without lifting your hand and without going over a segment twice. It is given in the problem that if this is possible, then you can do whatever you want. However, we already know that you cannot do whatever you want. Therefore, the assumption must be false.
– Rahul
Nov 23 '18 at 11:46