olymmath

KöMaL 2019 A764

    We call a diagonal of a polygon nice, if it is entirely inside the polygon or entirely outside the polygon. Let PP be an nn-gon with no three of its vertices being on the same line. Prove that PP has at least 32(n−3)\frac32(n-3) nice diagonals.

    Official text KöMaL. 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 hu-komal/2019/a764 · Tag 23MW7YDMPD · Edit this page on GitHub · Keys: j next, k previous