Erdős problem 1026 · problems.science

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

Workspace

Continue locally Open source Sign in to contribute

Open this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.

Canvas

public preview

Source#1026
→
ResultNone
→
Checks0

Reported activity

Work these sources record against this Problem. Source-reported attribution, 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

Reported activity

Search problems.science