Problem

Source: ARO 1993, problem 11.4

Tags: geometry, vector, rotation, combinatorics unsolved, combinatorics



Given a regular $ 2n$-gon, show that each of its sides and diagonals can be assigned in such a way that the sum of the obtained vectors equals zero.