Erdős problem 1026
For a sequence of distinct reals, determine the largest constant such that some monotonic subsequence always has sum exceeding times the total sum. Resolved as .
Sources
Retained excerpts/
VibeMathed
Retained source excerpt
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$.
Open exact source location