olymmath

SHARYGIN 2012 Problem 2

    A cyclic nn-gon is divided by non-intersecting (inside the nn-gon) diagonals to n−2n - 2 triangles. Each of these triangles is similar to at least one of the remaining ones. For what nn this is possible?

    Official text Sharygin Geometry Olympiad 2012 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/2012/p2 · Tag M0XSJP7XKP · Edit this page on GitHub · Keys: j next, k previous