Problem of parity - Can we draw a closed path made up of 20 line segments… [on hold]
$begingroup$
Can we draw a closed path made up of 20 line segments, each of which intersects exactly one of the other segments?
recreational-mathematics parity
asked Apr 6 at 22:38
Luiz FariasLuiz Farias
262
New contributor
Luiz Farias is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
put on hold as off-topic by José Carlos Santos, Javi, user21820, Xander Henderson, RRL 2 days ago
This question appears to be off-topic. The users who voted to close gave this specific reason:
- "This question is missing context or other details: Please provide additional context, which ideally explains why the question is relevant to you and our community. Some forms of context include: background and motivation, relevant definitions, source, possible strategies, your current progress, why the question is interesting or important, etc." – José Carlos Santos, Javi, user21820, Xander Henderson, RRL
If this question can be reworded to fit the rules in the help center, please edit the question.
add a comment |
$begingroup$
Can we draw a closed path made up of 20 line segments, each of which intersects exactly one of the other segments?
recreational-mathematics parity
asked Apr 6 at 22:38
Luiz FariasLuiz Farias
262
New contributor
Luiz Farias is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
put on hold as off-topic by José Carlos Santos, Javi, user21820, Xander Henderson, RRL 2 days ago
This question appears to be off-topic. The users who voted to close gave this specific reason:
- "This question is missing context or other details: Please provide additional context, which ideally explains why the question is relevant to you and our community. Some forms of context include: background and motivation, relevant definitions, source, possible strategies, your current progress, why the question is interesting or important, etc." – José Carlos Santos, Javi, user21820, Xander Henderson, RRL
If this question can be reworded to fit the rules in the help center, please edit the question.
add a comment |
$begingroup$
Can we draw a closed path made up of 20 line segments, each of which intersects exactly one of the other segments?
recreational-mathematics parity
asked Apr 6 at 22:38
Luiz FariasLuiz Farias
262
New contributor
Luiz Farias is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
Can we draw a closed path made up of 20 line segments, each of which intersects exactly one of the other segments?
recreational-mathematics parity
recreational-mathematics parity
asked Apr 6 at 22:38
Luiz FariasLuiz Farias
262
New contributor
Luiz Farias is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked Apr 6 at 22:38
Luiz FariasLuiz Farias
262
New contributor
Luiz Farias is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked Apr 6 at 22:38
Luiz FariasLuiz Farias
262
New contributor
Luiz Farias is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked Apr 6 at 22:38
Luiz FariasLuiz Farias
262
asked Apr 6 at 22:38
Luiz FariasLuiz Farias
262
262
New contributor
Luiz Farias is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
Luiz Farias is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
Luiz Farias is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
put on hold as off-topic by José Carlos Santos, Javi, user21820, Xander Henderson, RRL 2 days ago
This question appears to be off-topic. The users who voted to close gave this specific reason:
- "This question is missing context or other details: Please provide additional context, which ideally explains why the question is relevant to you and our community. Some forms of context include: background and motivation, relevant definitions, source, possible strategies, your current progress, why the question is interesting or important, etc." – José Carlos Santos, Javi, user21820, Xander Henderson, RRL
If this question can be reworded to fit the rules in the help center, please edit the question.
put on hold as off-topic by José Carlos Santos, Javi, user21820, Xander Henderson, RRL 2 days ago
This question appears to be off-topic. The users who voted to close gave this specific reason:
- "This question is missing context or other details: Please provide additional context, which ideally explains why the question is relevant to you and our community. Some forms of context include: background and motivation, relevant definitions, source, possible strategies, your current progress, why the question is interesting or important, etc." – José Carlos Santos, Javi, user21820, Xander Henderson, RRL
If this question can be reworded to fit the rules in the help center, please edit the question.
add a comment |
add a comment |
3 Answers
3
active
oldest
votes
$begingroup$
David G. Stork's example with $18$ points and edges can easily be changed into an example with $10$ points and edges based on a pentagon inside another pentagon with alternating links. So take two of those $10$ solutions, one inside the other, and then join them appropriately to get something like this with $20$ points and edges.
answered Apr 6 at 23:39
HenryHenry
101k482170
$endgroup$
2
$begingroup$
Interesting that it has to "reverse direction"; I wonder if there's a winding-number argument to show something like this must be true...but I'm too groggy to work one out.
$endgroup$
– John Hughes
Apr 6 at 23:46
1
$begingroup$
Bravo! (+1).... the key seems to be reversing chirality.
$endgroup$
– David G. Stork
Apr 6 at 23:57
$begingroup$
It would be similarly possible to combine $6$ and $14$ solutions, and to have the sub-solutions next to each other rather than one inside the other
$endgroup$
– Henry
Apr 7 at 0:19
$begingroup$
@Henry: Can you write code (Mathematica?) to generate a solution given $n = 2k$? That would be incredible. (I wrote code for my $n = 18$ "solution.")
$endgroup$
– David G. Stork
Apr 7 at 0:24
$begingroup$
@DavidG.Stork - I am afraid no as I do not do Mathematica. But the answer should be realtively simple: if $k$ is odd (and at least $3$) use your solution, while if $k$ is even (and at least $6$) then split it into two odd numbers (each at least $3$) and use your solution on each, finally adjusting to join them. This means I do not have a solution for $k=4$, i.e. for $n=8$
$endgroup$
– Henry
Apr 7 at 0:45
add a comment |
$begingroup$
(I assume there can be no crossings at vertices or corners.)
Here is one solution for $18$ (and @Henry, below, generalizes to $20$):
Since each segment is crossed by exactly one other segment, we can think of the problem as having 10 Xs that have to be linked without crossing.
answered Apr 6 at 22:56
David G. StorkDavid G. Stork
12.2k41736
$endgroup$
1
$begingroup$
Indeed - you seem to use $9$ being odd, though $10$ is not
$endgroup$
– Henry
Apr 6 at 23:06
add a comment |
$begingroup$
You can certainly do it if your drawing is on a torus: draw a decagon that goes "through the hole"; then draw a zigzag (like the one in your picture) that crosses each edge of the decagon once. The two ends of the zigzag will end up on opposite "sides" of the original decagon, but can be joined "around the back". By converting the situation to one involving a "square donut" (akin to this one) you can probably do this all with straight lines, although that may be easier if the cross-section is a pentagon rather than a square...
answered Apr 6 at 23:37
John HughesJohn Hughes
65.4k24293
$endgroup$
$begingroup$
I wonder if your "square donut" will force kinks in lines, thereby breaking the conditions of the problem. Possible... but not certain...
$endgroup$
– David G. Stork
Apr 7 at 0:04
$begingroup$
You may well be right. Could be that there's a Z/2Z obstruction hiding in here somewhere.
$endgroup$
– John Hughes
Apr 7 at 0:12
add a comment |
3 Answers
3
active
oldest
votes
3 Answers
3
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
David G. Stork's example with $18$ points and edges can easily be changed into an example with $10$ points and edges based on a pentagon inside another pentagon with alternating links. So take two of those $10$ solutions, one inside the other, and then join them appropriately to get something like this with $20$ points and edges.
answered Apr 6 at 23:39
HenryHenry
101k482170
$endgroup$
2
$begingroup$
Interesting that it has to "reverse direction"; I wonder if there's a winding-number argument to show something like this must be true...but I'm too groggy to work one out.
$endgroup$
– John Hughes
Apr 6 at 23:46
1
$begingroup$
Bravo! (+1).... the key seems to be reversing chirality.
$endgroup$
– David G. Stork
Apr 6 at 23:57
$begingroup$
It would be similarly possible to combine $6$ and $14$ solutions, and to have the sub-solutions next to each other rather than one inside the other
$endgroup$
– Henry
Apr 7 at 0:19
$begingroup$
@Henry: Can you write code (Mathematica?) to generate a solution given $n = 2k$? That would be incredible. (I wrote code for my $n = 18$ "solution.")
$endgroup$
– David G. Stork
Apr 7 at 0:24
$begingroup$
@DavidG.Stork - I am afraid no as I do not do Mathematica. But the answer should be realtively simple: if $k$ is odd (and at least $3$) use your solution, while if $k$ is even (and at least $6$) then split it into two odd numbers (each at least $3$) and use your solution on each, finally adjusting to join them. This means I do not have a solution for $k=4$, i.e. for $n=8$
$endgroup$
– Henry
Apr 7 at 0:45
add a comment |
$begingroup$
David G. Stork's example with $18$ points and edges can easily be changed into an example with $10$ points and edges based on a pentagon inside another pentagon with alternating links. So take two of those $10$ solutions, one inside the other, and then join them appropriately to get something like this with $20$ points and edges.
answered Apr 6 at 23:39
HenryHenry
101k482170
$endgroup$
2
$begingroup$
Interesting that it has to "reverse direction"; I wonder if there's a winding-number argument to show something like this must be true...but I'm too groggy to work one out.
$endgroup$
– John Hughes
Apr 6 at 23:46
1
$begingroup$
Bravo! (+1).... the key seems to be reversing chirality.
$endgroup$
– David G. Stork
Apr 6 at 23:57
$begingroup$
It would be similarly possible to combine $6$ and $14$ solutions, and to have the sub-solutions next to each other rather than one inside the other
$endgroup$
– Henry
Apr 7 at 0:19
$begingroup$
@Henry: Can you write code (Mathematica?) to generate a solution given $n = 2k$? That would be incredible. (I wrote code for my $n = 18$ "solution.")
$endgroup$
– David G. Stork
Apr 7 at 0:24
$begingroup$
@DavidG.Stork - I am afraid no as I do not do Mathematica. But the answer should be realtively simple: if $k$ is odd (and at least $3$) use your solution, while if $k$ is even (and at least $6$) then split it into two odd numbers (each at least $3$) and use your solution on each, finally adjusting to join them. This means I do not have a solution for $k=4$, i.e. for $n=8$
$endgroup$
– Henry
Apr 7 at 0:45
add a comment |
$begingroup$
David G. Stork's example with $18$ points and edges can easily be changed into an example with $10$ points and edges based on a pentagon inside another pentagon with alternating links. So take two of those $10$ solutions, one inside the other, and then join them appropriately to get something like this with $20$ points and edges.
answered Apr 6 at 23:39
HenryHenry
101k482170
$endgroup$
David G. Stork's example with $18$ points and edges can easily be changed into an example with $10$ points and edges based on a pentagon inside another pentagon with alternating links. So take two of those $10$ solutions, one inside the other, and then join them appropriately to get something like this with $20$ points and edges.
answered Apr 6 at 23:39
HenryHenry
101k482170
edited Apr 6 at 23:46
answered Apr 6 at 23:39
HenryHenry
101k482170
answered Apr 6 at 23:39
HenryHenry
101k482170
answered Apr 6 at 23:39
HenryHenry
101k482170
101k482170
2
$begingroup$
Interesting that it has to "reverse direction"; I wonder if there's a winding-number argument to show something like this must be true...but I'm too groggy to work one out.
$endgroup$
– John Hughes
Apr 6 at 23:46
1
$begingroup$
Bravo! (+1).... the key seems to be reversing chirality.
$endgroup$
– David G. Stork
Apr 6 at 23:57
$begingroup$
It would be similarly possible to combine $6$ and $14$ solutions, and to have the sub-solutions next to each other rather than one inside the other
$endgroup$
– Henry
Apr 7 at 0:19
$begingroup$
@Henry: Can you write code (Mathematica?) to generate a solution given $n = 2k$? That would be incredible. (I wrote code for my $n = 18$ "solution.")
$endgroup$
– David G. Stork
Apr 7 at 0:24
$begingroup$
@DavidG.Stork - I am afraid no as I do not do Mathematica. But the answer should be realtively simple: if $k$ is odd (and at least $3$) use your solution, while if $k$ is even (and at least $6$) then split it into two odd numbers (each at least $3$) and use your solution on each, finally adjusting to join them. This means I do not have a solution for $k=4$, i.e. for $n=8$
$endgroup$
– Henry
Apr 7 at 0:45
add a comment |
2
$begingroup$
Interesting that it has to "reverse direction"; I wonder if there's a winding-number argument to show something like this must be true...but I'm too groggy to work one out.
$endgroup$
– John Hughes
Apr 6 at 23:46
1
$begingroup$
Bravo! (+1).... the key seems to be reversing chirality.
$endgroup$
– David G. Stork
Apr 6 at 23:57
$begingroup$
It would be similarly possible to combine $6$ and $14$ solutions, and to have the sub-solutions next to each other rather than one inside the other
$endgroup$
– Henry
Apr 7 at 0:19
$begingroup$
@Henry: Can you write code (Mathematica?) to generate a solution given $n = 2k$? That would be incredible. (I wrote code for my $n = 18$ "solution.")
$endgroup$
– David G. Stork
Apr 7 at 0:24
$begingroup$
@DavidG.Stork - I am afraid no as I do not do Mathematica. But the answer should be realtively simple: if $k$ is odd (and at least $3$) use your solution, while if $k$ is even (and at least $6$) then split it into two odd numbers (each at least $3$) and use your solution on each, finally adjusting to join them. This means I do not have a solution for $k=4$, i.e. for $n=8$
$endgroup$
– Henry
Apr 7 at 0:45
2
2
$begingroup$
Interesting that it has to "reverse direction"; I wonder if there's a winding-number argument to show something like this must be true...but I'm too groggy to work one out.
$endgroup$
– John Hughes
Apr 6 at 23:46
$begingroup$
Interesting that it has to "reverse direction"; I wonder if there's a winding-number argument to show something like this must be true...but I'm too groggy to work one out.
$endgroup$
– John Hughes
Apr 6 at 23:46
1
1
$begingroup$
Bravo! (+1).... the key seems to be reversing chirality.
$endgroup$
– David G. Stork
Apr 6 at 23:57
$begingroup$
Bravo! (+1).... the key seems to be reversing chirality.
$endgroup$
– David G. Stork
Apr 6 at 23:57
$begingroup$
It would be similarly possible to combine $6$ and $14$ solutions, and to have the sub-solutions next to each other rather than one inside the other
$endgroup$
– Henry
Apr 7 at 0:19
$begingroup$
It would be similarly possible to combine $6$ and $14$ solutions, and to have the sub-solutions next to each other rather than one inside the other
$endgroup$
– Henry
Apr 7 at 0:19
$begingroup$
@Henry: Can you write code (Mathematica?) to generate a solution given $n = 2k$? That would be incredible. (I wrote code for my $n = 18$ "solution.")
$endgroup$
– David G. Stork
Apr 7 at 0:24
$begingroup$
@Henry: Can you write code (Mathematica?) to generate a solution given $n = 2k$? That would be incredible. (I wrote code for my $n = 18$ "solution.")
$endgroup$
– David G. Stork
Apr 7 at 0:24
$begingroup$
@DavidG.Stork - I am afraid no as I do not do Mathematica. But the answer should be realtively simple: if $k$ is odd (and at least $3$) use your solution, while if $k$ is even (and at least $6$) then split it into two odd numbers (each at least $3$) and use your solution on each, finally adjusting to join them. This means I do not have a solution for $k=4$, i.e. for $n=8$
$endgroup$
– Henry
Apr 7 at 0:45
$begingroup$
@DavidG.Stork - I am afraid no as I do not do Mathematica. But the answer should be realtively simple: if $k$ is odd (and at least $3$) use your solution, while if $k$ is even (and at least $6$) then split it into two odd numbers (each at least $3$) and use your solution on each, finally adjusting to join them. This means I do not have a solution for $k=4$, i.e. for $n=8$
$endgroup$
– Henry
Apr 7 at 0:45
add a comment |
$begingroup$
(I assume there can be no crossings at vertices or corners.)
Here is one solution for $18$ (and @Henry, below, generalizes to $20$):
Since each segment is crossed by exactly one other segment, we can think of the problem as having 10 Xs that have to be linked without crossing.
answered Apr 6 at 22:56
David G. StorkDavid G. Stork
12.2k41736
$endgroup$
1
$begingroup$
Indeed - you seem to use $9$ being odd, though $10$ is not
$endgroup$
– Henry
Apr 6 at 23:06
add a comment |
$begingroup$
(I assume there can be no crossings at vertices or corners.)
Here is one solution for $18$ (and @Henry, below, generalizes to $20$):
Since each segment is crossed by exactly one other segment, we can think of the problem as having 10 Xs that have to be linked without crossing.
answered Apr 6 at 22:56
David G. StorkDavid G. Stork
12.2k41736
$endgroup$
1
$begingroup$
Indeed - you seem to use $9$ being odd, though $10$ is not
$endgroup$
– Henry
Apr 6 at 23:06
add a comment |
$begingroup$
(I assume there can be no crossings at vertices or corners.)
Here is one solution for $18$ (and @Henry, below, generalizes to $20$):
Since each segment is crossed by exactly one other segment, we can think of the problem as having 10 Xs that have to be linked without crossing.
answered Apr 6 at 22:56
David G. StorkDavid G. Stork
12.2k41736
$endgroup$
(I assume there can be no crossings at vertices or corners.)
Here is one solution for $18$ (and @Henry, below, generalizes to $20$):
Since each segment is crossed by exactly one other segment, we can think of the problem as having 10 Xs that have to be linked without crossing.
answered Apr 6 at 22:56
David G. StorkDavid G. Stork
12.2k41736
edited Apr 6 at 23:59
answered Apr 6 at 22:56
David G. StorkDavid G. Stork
12.2k41736
answered Apr 6 at 22:56
David G. StorkDavid G. Stork
12.2k41736
answered Apr 6 at 22:56
David G. StorkDavid G. Stork
12.2k41736
12.2k41736
1
$begingroup$
Indeed - you seem to use $9$ being odd, though $10$ is not
$endgroup$
– Henry
Apr 6 at 23:06
add a comment |
1
$begingroup$
Indeed - you seem to use $9$ being odd, though $10$ is not
$endgroup$
– Henry
Apr 6 at 23:06
1
1
$begingroup$
Indeed - you seem to use $9$ being odd, though $10$ is not
$endgroup$
– Henry
Apr 6 at 23:06
$begingroup$
Indeed - you seem to use $9$ being odd, though $10$ is not
$endgroup$
– Henry
Apr 6 at 23:06
add a comment |
$begingroup$
You can certainly do it if your drawing is on a torus: draw a decagon that goes "through the hole"; then draw a zigzag (like the one in your picture) that crosses each edge of the decagon once. The two ends of the zigzag will end up on opposite "sides" of the original decagon, but can be joined "around the back". By converting the situation to one involving a "square donut" (akin to this one) you can probably do this all with straight lines, although that may be easier if the cross-section is a pentagon rather than a square...
answered Apr 6 at 23:37
John HughesJohn Hughes
65.4k24293
$endgroup$
$begingroup$
I wonder if your "square donut" will force kinks in lines, thereby breaking the conditions of the problem. Possible... but not certain...
$endgroup$
– David G. Stork
Apr 7 at 0:04
$begingroup$
You may well be right. Could be that there's a Z/2Z obstruction hiding in here somewhere.
$endgroup$
– John Hughes
Apr 7 at 0:12
add a comment |
$begingroup$
You can certainly do it if your drawing is on a torus: draw a decagon that goes "through the hole"; then draw a zigzag (like the one in your picture) that crosses each edge of the decagon once. The two ends of the zigzag will end up on opposite "sides" of the original decagon, but can be joined "around the back". By converting the situation to one involving a "square donut" (akin to this one) you can probably do this all with straight lines, although that may be easier if the cross-section is a pentagon rather than a square...
answered Apr 6 at 23:37
John HughesJohn Hughes
65.4k24293
$endgroup$
$begingroup$
I wonder if your "square donut" will force kinks in lines, thereby breaking the conditions of the problem. Possible... but not certain...
$endgroup$
– David G. Stork
Apr 7 at 0:04
$begingroup$
You may well be right. Could be that there's a Z/2Z obstruction hiding in here somewhere.
$endgroup$
– John Hughes
Apr 7 at 0:12
add a comment |
$begingroup$
You can certainly do it if your drawing is on a torus: draw a decagon that goes "through the hole"; then draw a zigzag (like the one in your picture) that crosses each edge of the decagon once. The two ends of the zigzag will end up on opposite "sides" of the original decagon, but can be joined "around the back". By converting the situation to one involving a "square donut" (akin to this one) you can probably do this all with straight lines, although that may be easier if the cross-section is a pentagon rather than a square...
answered Apr 6 at 23:37
John HughesJohn Hughes
65.4k24293
$endgroup$
You can certainly do it if your drawing is on a torus: draw a decagon that goes "through the hole"; then draw a zigzag (like the one in your picture) that crosses each edge of the decagon once. The two ends of the zigzag will end up on opposite "sides" of the original decagon, but can be joined "around the back". By converting the situation to one involving a "square donut" (akin to this one) you can probably do this all with straight lines, although that may be easier if the cross-section is a pentagon rather than a square...
answered Apr 6 at 23:37
John HughesJohn Hughes
65.4k24293
answered Apr 6 at 23:37
John HughesJohn Hughes
65.4k24293
answered Apr 6 at 23:37
John HughesJohn Hughes
65.4k24293
answered Apr 6 at 23:37
John HughesJohn Hughes
65.4k24293
65.4k24293
$begingroup$
I wonder if your "square donut" will force kinks in lines, thereby breaking the conditions of the problem. Possible... but not certain...
$endgroup$
– David G. Stork
Apr 7 at 0:04
$begingroup$
You may well be right. Could be that there's a Z/2Z obstruction hiding in here somewhere.
$endgroup$
– John Hughes
Apr 7 at 0:12
add a comment |
$begingroup$
I wonder if your "square donut" will force kinks in lines, thereby breaking the conditions of the problem. Possible... but not certain...
$endgroup$
– David G. Stork
Apr 7 at 0:04
$begingroup$
You may well be right. Could be that there's a Z/2Z obstruction hiding in here somewhere.
$endgroup$
– John Hughes
Apr 7 at 0:12
$begingroup$
I wonder if your "square donut" will force kinks in lines, thereby breaking the conditions of the problem. Possible... but not certain...
$endgroup$
– David G. Stork
Apr 7 at 0:04
$begingroup$
I wonder if your "square donut" will force kinks in lines, thereby breaking the conditions of the problem. Possible... but not certain...
$endgroup$
– David G. Stork
Apr 7 at 0:04
$begingroup$
You may well be right. Could be that there's a Z/2Z obstruction hiding in here somewhere.
$endgroup$
– John Hughes
Apr 7 at 0:12
$begingroup$
You may well be right. Could be that there's a Z/2Z obstruction hiding in here somewhere.
$endgroup$
– John Hughes
Apr 7 at 0:12
add a comment |
