olymmath

IGO 2017 I3

  • Intermediate

On the plane, nn points are given ( n>2n>2 ). No three of them are collinear. Through each two of them the line is drawn, and among the other given points, the one nearest to this line is marked (in each case this point occurred to be unique). What is the maximal possible number of marked points for each given nn ?

Proposed by Boris Frenkin (Russia)

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

Similar problems

These problems have the most words in common with this statement.

Locator igo/2017/i3 · Tag 1QZPEYE5CZ · Edit this page on GitHub · Keys: j next, k previous