Skip to content

Erdős problem 1026

Start work

For a sequence of nn distinct reals, determine the largest constant cc such that some monotonic subsequence always has sum exceeding (c−o(1))⋅(1/n)(c-o(1))\cdot(1/\sqrt{n}) times the total sum. Resolved as c=1c = 1.

Workspace

Continue locallyOpen sourceSign in to contribute

Opens this exact Problem and source revision in Workbench. Nothing is cloned, uploaded, or executed.

How a contribution reaches this record

Seven steps, in four places.

  1. Read the sources and their formal declarations.

    Public

  2. Work on it, wherever you work.

    Your machine

  3. Keep an Approach and its Attempts here.

    Needs an account

  4. Attach evidence by its content root.

    Needs an account

  5. Prepare an unsigned Submission draft.

    Needs an account

  6. Sign it with your own key.

    Your machine

  7. The Repository decides.

    The Repository

Reported activity

Reported by these sources. Not reviewed here.

  • AI alongside literature

    Erdős AI contributions wiki · 7 Dec, 2025

    Machine
    Aristotle
    Open the source record

  • AI collaborating with humans

    Erdős AI contributions wiki · 8 Dec, 2025

    Machine
    AlphaEvolve, Aristotle, Gemini, GPT
    People
    Boris Alexeev, Stijn Cambie, Terence Tao, Lawrence Wu
    Open the source record

  • argument

    VibeMathed

    Machine
    Aristotle, with GPT, Gemini and AlphaEvolve also contributing
    People
    Boris Alexeev, Stijn Cambie, Terence Tao, Lawrence Wu
    Reported outcome
    resolved
    Open the source record