Question 108
Consider the vertices of a regular $n$ corner and somehow connect them with sides or diagonals into a closed stretch that passes through each corner exactly once. A parallel pair is a set of two different parallel routes in this track. Show:
a. is $n$ straight, then there is always at least one parallel pair.
b. is odd $n$, then there is never exactly a parallel pair.
a. is $n$ straight, then there is always at least one parallel pair.
b. is odd $n$, then there is never exactly a parallel pair.