IR-TST 2020 Problem 6

Test 1

$n$ positive numbers are given. Is it always possible to find a convex polygon with $n+3$ edges and a triangulation of it so that the length of the diameters used in the triangulation are the given $n$ numbers?

Proposed by Morteza Saghafian

Dataset text AI-MO AoPS. Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Solutions

Similar problems