olymmath

TSTST 2026 Problem 9

    In the plane, we say that a set of points A={A1,A2,…,Ak}A = \{A_1, A_2, \dots, A_k\} demolishes a set of points B={B1,B2,…,Bℓ}B = \{B_1, B_2, \dots, B_\ell\} if, for all points PP,

    PA1+PA2+⋯+PAk≥PB1+PB2+⋯+PBℓ.PA_1 + PA_2 + \cdots + PA_k \geq PB_1 + PB_2 + \cdots + PB_\ell.

    Let SS be a set of nn points in the plane. Show that we can partition SS into two sets AA and BB such that AA demolishes BB and ∣A∣≤∣B∣+100n|A| \leq |B| + 100\sqrt{n}.

    Official text USA TST for the TST 2026 official paper, page 3. Quoted with source.

    A model read this text from the scan of the paper by OCR, with vision/claude@2.1.318 (claude-opus-5-5). 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 tstst/2026/p9 · Tag ABBFC80D1D · Edit this page on GitHub · Keys: j next, k previous