olymmath

MEMO 2021 T4

    Let nn be a positive integer. Prove that in a regular 6n6n -gon, we can draw 3n3n diagonals with pairwise distinct ends and partition the drawn diagonals into nn triplets so that:

    • the diagonals in each triplet intersect in one interior point of the polygon and
    • all these nn intersection points are distinct.

    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 memo/2021/t4 · Tag G9QB5N7GJT · Edit this page on GitHub · Keys: j next, k previous