olymmath

RO-TST 2010 Problem 1

    Given an integer number n≥3n \geq 3 , consider nn distinct points on a circle, labelled 11 through nn . Determine the maximum number of closed chords [ij][ij] , i≠ji \neq j , having pairwise non-empty intersections.

    János Pach

    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

    Locator ro-tst/2010/p1 · Tag E98FPRAP53 · Edit this page on GitHub · Keys: j next, k previous