MathDB

Given is a natural number

n\geqslant 3

. Find the smallest

k{}

for which the following statement is true: for any

n{}

-gon and any two points inside it there is a broken line with

k{}

segments connecting these points, lying entirely inside the

n{}

-gon.
Proposed by L. Emelyanov

M2728