olymmath

SHARYGIN 2010 Problem 11

    A convex nn-gon is split into three convex polygons. One of them has nn sides, the second one has more than nn sides, the third one has less than nn sides. Find all possible values of nn.

    Official text Sharygin Geometry Olympiad 2010 official paper, page 2. Quoted with source.

    A model read this text from the scan of the paper by OCR, with vision/local (GLM-OCR-8bit). No person has checked it against the paper yet.

    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 sharygin/2010/p11 · Tag 9MEG5G8XQR · Edit this page on GitHub · Keys: j next, k previous