2014 OIM Problems/Problem 3

Revision as of 14:09, 14 December 2023 by Tomasdiaz (talk | contribs) (Created page with "== Problem == 2014 points are marked on a circle. On each of the segments whose ends are two of the 2014 points, a non-negative real number is written. It's known that For any...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

2014 points are marked on a circle. On each of the segments whose ends are two of the 2014 points, a non-negative real number is written. It's known that For any convex polygon whose vertices are some of the 2014 points, the sum of the numbers written on its sides is less than or equal to 1. Find the maximum possible value of the sum of all the numbers written.

~translated into English by Tomas Diaz. ~orders@tomasdiaz.com

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.

See also

OIM Problems and Solutions