olymmath

SCHWEITZER 2000 Problem 3

    Prove that for every integer n≥3n\ge 3 there exists N(n)N(n) with the following property: whenever PP is a set of at least N(n)N(n) points of the plane such that any three points of PP determines a nondegenerate triangle containing at most one point of PP in its interior, then PP contains the vertices of a convex nn -gon whose interior does not contain any point of PP .

    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 schweitzer/2000/p3 · Tag 5YQFS8DDFT · Edit this page on GitHub · Keys: j next, k previous