Question 84
Let $n \ge 3$ be any natural number. A real number is written into every vertex of a regular $n$-gon in such a way that numbers in any two neighbouring vertices differ by at most $1$. Find the least non-negative real number $C$ such that, regardless of the choice of the numbers in the vertices, there exist two neighbouring vertices in which numbers differ by at most $C$.