Problem detail · source-aware
VibeMathed reports this item as resolved. VibeMath preserves that report as a source assertion and has not independently authored a plain-language mathematical explanation.
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$.
The source statement is reproduced for indexing with attribution. Mathematical correctness requires domain-expert or mechanical review. VibeMath has not independently audited statement fidelity, correctness, priority, or novelty.
Multiple AI systems contributed within an ordinary human mathematical collaboration rather than one model solving it outright; Aristotle produced and formally verified the winning proof in Lean, pinning down the sharp constant $c = 1$.
Provider: Harmonic / OpenAI / Google DeepMind · Prompt public: unknown · Independence: unknown
Formally verified in Lean. Documented firsthand by Terence Tao on his blog as a case study in AI-assisted collaboration, not an AI-alone result.
Correctness: supported · statement fidelity: audited · peer review: none
VibeMathed reports this item as resolved. VibeMath preserves that report as a source assertion and has not independently authored a plain-language mathematical explanation.
Source-reported tools: argument.
Independent: unknown · difference confidence: 0
VibeMath has not independently audited the mathematical statement, proof, or novelty claim.