Some sides and diagonals of a regular n-gon form a connected path that visits each vertex exactly once. A parallel pair of edges is a pair of two different parallel edges of the path. Prove that
(a) if n is even, there is at least one parallel pair.
(b) if n is odd, there can't be one single parallel pair. combinatorics proposedcombinatorics