Problem

Source: New Zealand MO 2019 Round 1 p6

Tags: combinatorics, Regular



Let $V$ be the set of vertices of a regular $21$-gon. Given a non-empty subset $U$ of $V$ , let $m(U)$ be the number of distinct lengths that occur between two distinct vertices in $U$. What is the maximum value of $\frac{m(U)}{|U|}$ as $U$ varies over all non-empty subsets of $V$ ?