z-logo
open-access-imgOpen Access
On the mean length of the diagonals of an $n$-gon
Author(s) -
Lükő Gábor
Publication year - 2013
Publication title -
elemente der mathematik
Language(s) - English
Resource type - Journals
eISSN - 1420-8962
pISSN - 0013-6018
DOI - 10.4171/em/215
Subject(s) - diagonal , mathematics , combinatorics , geometry
P. Erdős [1] conjectured that the mean length of the diagonals of a convex n-gon with perimeter L is maximal iff n/2 vertices are concentrated in a point A and the remaining n/2 vertices in a point B whose distance is L/2 in case of n = 2k. If n = 2k + 1, then k and k + 1 vertices are concentrated in A and B , respectively, in the extremal figure. The minimum is attained when n − 1 vertices are concentrated in A and a single one in B .

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom