MathDB
A car moves around a regular n-gon

Source:

September 13, 2010
geometryperimetercombinatorics unsolvedcombinatorics

Problem Statement

From each of the vertices of a regular nn-gon a car starts to move with constant speed along the perimeter of the nn-gon in the same direction. Prove that if all the cars end up at a vertex AA at the same time, then they never again meet at any other vertex of the nn-gon. Can they meet again at A ?A \ ?