Demonstrandum multi-agent pipeline
The source does not provide a sufficiently specific role description.
Provider: unknown · Prompt public: unknown · Independence: unknown
Problem detail · source-aware
Erdős Problem #866
VibeMathed reports this item as partial. VibeMath preserves that report as a source assertion and has not independently authored a plain-language mathematical explanation.
Precise statement
Estimate the least excess $g_k(N)$ forcing $k$ integers whose pairwise sums all lie in a dense subset of $\{1, \dots, 2N\}$; in particular, determine the positive variant $h_4(n)$.
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.
What AI did
Verification boundary
Headline theorems Lean-checked; 298 exact finite cells independently certified.
Correctness: supported · statement fidelity: audited · peer review: none
Timeline
-
erdosproblems.com/866
h₄(n) = 4 for every n ≥ 331,777, with improved global bounds; the broader problem remains open
Known method families
argument (source-reported)
Source-reported tools: argument.
Independent: unknown · difference confidence: 0
What remains uncertain
VibeMath has not independently audited the mathematical statement, proof, or novelty claim.
- VibeMath has not independently verified the mathematical claim.
- AI-attempt independence and training-data exposure are unknown unless explicitly documented.
- VibeMath has not independently audited the mathematical statement, proof, or novelty claim.